COS 226 PROBLEM SET 7
Give the contents of the stack at each step of
the Graham scan algorithm for computing the convex hull
of the points (6,3) (5,6) (8,2) (4,7) (3,9) and (1,5).
Evaluate the maximum number of times the stack can be popped during
the application of Graham Scan to a set of N points.
Due: in precept on April 10/11.
Do your work on this page (use the back if you must)