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