Design a linear-time algorithm to determine two extreme points of the convex hull of a given set of n > 1 points in the plane.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.