Question

Implemented the ladder method with recursion. The first version will find the largest value. The second version will find the index of the largest value. In principle, you could just implement the second version and use that index to find the largest value for the first version; you are not supposed to do so. For both versions, you may only use a constant amount of extra memory, other than the extra memory that the recursion automatically uses on the stack (or heap) during execution. You can assume that the array is stored in locations 1, . . . , n or locations 0, . . . , n − 1, whichever you prefer. Assume that n is a power of 2.

(a) Write the pseudo-code for a recursive implementation of the ladder method of finding the largest of n values.

(b) Write the pseudo-code for a recursive implementation of the ladder method of finding the index of the largest of n values.

Answer 1

public static int findMaxIndex(double[] values){

// verdict the length of the values array

int noOfValues = values.length;

// declare max and maxIndex to store max and

// maxIndex

double max = 0.0;

int maxIndex;

for(int i =0; i < noOfValues ; i++){

//verifying if the current value is greater than max

//if greater afterwards storing the value in max and

// index in maxIndex

if(values[i] > max){

max = values[i];

maxIndex = i;

}

}

// recurring maxIndex

return maxIndex;

}