| 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.
|
| 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 |
This class provide a robust and extremely fast algorithm to estimate arbitary
quantile values from a continuing stream of data values.
|
| PriorityQueue |
Priority Queue for index items.
|
| 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 sorting algorithm that is a generalization of insertion
sort, with two observations:
insertion sort is efficient if the input is "almost sorted", and
insertion sort is typically inefficient because it moves values
just one position at a time.
|
| SortUtils |
Some useful functions such as swap and swif-down used in many sorting
algorithms.
|