Algorithm
Development Kit 1.0

Package algs.model.problems.convexhull.heap

Defines solution to the Convex Hull problem proposed by Andrew which uses HeapSort to sort the initial data set rather than QuickSort.

See:
          Description

Class Summary
HeapAndrew Computes Convex Hull following Andrew's Algorithm.
 

Package algs.model.problems.convexhull.heap Description

Defines solution to the Convex Hull problem proposed by Andrew which uses HeapSort to sort the initial data set rather than QuickSort.


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.