Just part 2

Suppose we have an array A of n distinct integers and moreover are guaranteed that the array has the following property: up to some index 1in,A is increasing, i.e., A[1]A[i+1]>>A[n]. In this array, we call A[i] the top of A. For example, consider the array [1,4,7,8,6,2], which has top 8 . For any two elements A[i],A[j] in the array, we may only compare the elements by testing inequality, i.e., A[i]