| Interface | Description |
|---|---|
| HeapSort |
Heapsort is a comparison-based sorting algorithm, and is part of the
selection sort family.
|
| QuickSelect |
Selection is asking for the k-th smallest element out of n elements.
|
| 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.
|
| 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 java.lang.Comparable<? super T>> |
This class tracks the smallest values seen thus far in a stream of values.
|
| IntHeapSelect |
This class tracks the smallest values seen thus far in a stream of values.
|
| IQAgent |
Incremental quantile estimation.
|
| QuickSort |
Quicksort is a well-known sorting algorithm that, on average, makes O(n log n)
comparisons to sort n items.
|