Algorithm: Polygon max element in O(log n)
Algorithm: Polygon max element in O(log n) Question: I want to find the vertice in convex polygon, which has the greatest x axis value. The polygon is convex and random. Its vertices are represented in array as tuples: (x,y). The vertices from cartesian coordinate system to array are ordered in counterclockwise order. The most left …