I'm looking for the solution of the following problem..!
I need to write a recursive function that has as arguments an array of characters and two bounds on array indices. The function should reverse the order of those entries in the array whose indices are between the two bounds. For example, suppose that the array is :
a = “abcde”;
and the bounds are 1 and 3. Then after the function is run the array elements should be “adcbe”.
Embed the function in a program and test it. To simplify grading, set up your character array as the whole alphabet:
And allow the user to specify bounds. Be sure to test our program using bounds that have both an even and an odd number of characters between them
Hope someone will help me with this.... Thanks in Advance.