This code was one of the assignments given to me in college. I had to break my head to work this out, and then finally found out that the program code was already present in my text book. But anyway, its always better to develop our own codes than referring to textbooks. So in this post i am sharing the code with the output as well as explanation with the help of a table.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 |
class rsort { public static void main(String args[]) { int a[]={5,3,2,1,4}; // or choose int a[] = {3,2,8,1,4}; int n = a.length; for(int i=0; i<n; i++) { System.out.print(" " + a[i]); } System.out.println(""); System.out.println("Max = " + max(a, 0, n-1)); System.out.println("Min = " + min(a, 0, n-1)); } static int max(int a[], int start, int end) { if(start<end) { if(a[start]<a[end]) { return max(a, start+1, end); } return max(a, start, end-1); } return a[end]; } static int min(int a[], int start, int end) { if(start<end) { if(a[start]>a[end]) { return min(a, start+1, end); } return min(a, start, end-1); } return a[end]; } } |

# Output

# Explanation of Max Recursive Method

- As you can see in the image below, the depth of recursion is five.
- Five recursive methods have been called to get the large (max) number.

- At the beginning the array {5,3,2,1,4} is passed into the rsort function with parameters (a, 0, n-1)
- where a is the array, 0 is the first index of array and n-1 is the last index of array.
- The rsort function accepts these values as follows : a is taken as a, 0 is taken as start, n-1 is taken as end.
- (a, 0, n-1) = (a, start, end) = (a, 0, 4)
- (start < end ? ) = (0 < 4 ? ) = Yes.
- (a[start] < a[end] ? ) = (5<4 ? ) = No.
- Recursive call (a, start, end-1) = (a, 0, 4-1) = (a,0, 3)
- (start < end ? ) = (0<3 ? ) = Yes.
- (a[start] < a[end] ? ) = (5<1 ? ) = No.
- Recursive call (a, start, end-1) = (a, 0, 3-1) = (a,0,2)
- And so on.. Check the table below for relevance and better understanding.