public class QuickSortComparable<T extends Comparable<T>> extends Object
An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of floats. A small amount of memory is declared for this sorting algorithm. This implementation of QuickSort allows you to use a Comparator. Useful when you want to ensure that no extra memory is declared each time you sort. This is possible when using built in methods.
Constructors Constructor Description
(int NSTACK, int M)