|
-
Covex Hull, any ideas ?
Assume you are given the black box ConvexHull. The black box takes as input a list of n coordinates in the plane. The black box then computes the convex hull of these points, and returns a list of the vertices of the convex hull in clockwise order starting at an arbitrary vertex.
Use the ConvexHull black box to design an algorithm that sorts a list of n distinct integers. Provide pseudocode for your algorithm, and a brief argument that your explanation is correct.
------------------
DHAHL3seasons GP:73 G:121 A:55 Pts:176 GWG:12 +/-:184
UWSWA1season GP:9 G:12 A:8 Pts:20 GWG:3 +/-:-3
MCBHL1season GP:3 G:5 A:4 Pts:9 GWG:0 +/-:10
uwcdc.com or namgor.com
DHAHL3seasons GP:73 G:121 A:55 Pts:176 GWG:12 +/-:184
UWSWA6seasons GP:41 G:53 A:46 Pts:99 GWG:5 +/-:-25
MCBHL3seasons GP:14 G:20 A:8 Pts:28 GWG:4 +/-:19
uwcdc.com or monkis.com
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
|