Question: Consider the following recursive method for finding the maximum element in an int array: public int static max(int[] a, int lo, int hi) { if
Consider the following recursive method for finding the maximum element in an int array:
public int static max(int[] a, int lo, int hi) { if (lo > hi) return a[lo]; int mid = (lo + hi) / 2; int loMax = max(a, lo, mid); int hiMax = max(a, mid+1, hi); if (loMax > hiMax) return loMax; else return hiMax; } Write down the recurrence relation for counting the number of times the comparison if (loMax > hiMax) is performed. Use the recurrence relation for merge sort as a model.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
