title: Find max y coordinate of a convex polygon
body: <p>I have an array <code>V[1,2,....,n]</code>, where each element of the array represents a vertex of a convex polygon in the form of a coordinate pair (x,y). </p>
  
  <p>It is given that <code>V[1]</code> is the vertex with the minimum x coordinate and that the vertices <code>V[1,2,....,n]</code> are ordered counterclockwise, as in the ﬁgure. It is also given that the x coordinates of the vertices are all distinct, as are the y coordinates of the vertices.
  <a href="https://i.stack.imgur.com/Gfikq.png" rel="noreferrer"><img src="https://i.stack.imgur.com/Gfikq.png" alt="enter image description here"></a></p>
  
  <p>Now, I want to find the vertex with max y coordinate value. We all know the naive O(n) method, but is it possible to find it in O(log(n))? </p>
  
  <p>I used the information that <code>V[1]</code> is the vertex with the minimum x coordinate to find the vertex with maximum x coordinate in O(log(n)) time. But is it possible to do it for maximum y coordinate?</p>
  
  <p>Thanks for the help!</p>