Suppose we maintain an array A of n int values as follows: A[0] < A[1] < . . . < A[i] > A[i + 1] > A[i + 2] > . . . > A[n - 1]
The ith element is the maximum in the array. What would be the lowest big-Oh notation for finding that element? Consider a variation of the binary search.

Question

Quizplus · Accepted Answer

A variation of binary search can be used to find the maximum element in O(log n) time by checking the middle element and determining which half of the array to search next based on the increasing and decreasing pattern.

Suppose We Maintain an Array a of N Int Values