Package smile.sort

package smile.sort

Sorting algorithms.

Class	Description
DoubleHeapSelect	This class tracks the smallest values seen thus far in a stream of values.
FloatHeapSelect	This class tracks the smallest values seen thus far in a stream of values.
HeapSelect<T extends Comparable<? super T>>	This class tracks the smallest values seen thus far in a stream of values.
HeapSort	Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family.
IntHeapSelect	This class tracks the smallest values seen thus far in a stream of values.
IQAgent	Incremental quantile estimation.
QuickSelect	Selection is asking for the k-th smallest element out of n elements.
QuickSort	Quicksort is a well-known sorting algorithm that, on average, makes O(n log n) comparisons to sort n items.
ShellSort	Shell sort is a generalization of insertion sort.
Sort	Sort algorithm trait that includes useful static functions such as swap and swift up/down used in many sorting algorithms.