Suppose we have a one-dimensional array of positive integers, A[], such that the integers in the array initially
increase and then decrease. See the examples of A[] below. Write an algorithm that runs faster than O(n) to
find the maximum integer in the array.
Examples: if A = (7, 9, 15, 13, 1), output is 15
If A = {4, 7, 9, 10, 25, 100, 150, 161, 160, 154, 122, 34, 26, 11, 5), output is 161.