For this project you will be asked to implement two convex hull algorithms. One of your algorithms should be output sensitive—having a runtime that depends on the number of points h on the final hull. The other algorithm should be worst-case n lg n. Note that Chan's algorithm can count as either algorithm, but not both. You must implement at least two approaches. You may work with one partner on this assignment.
Once you are satisfied with your programs, hand them in by typing handin35 at the unix prompt. You may run handin35 as many times as you like, and only the most recent submission will be recorded. This is useful if you realize after handing in some programs that you'd like to make a few more changes to them.