| Class | Description |
|---|---|
| BucketSort<T extends java.lang.Comparable> |
A sort algorithm (non-stable, out-of-place) that uses O(n) space and provides O(n) best-case
and O(n^2) average/worst-case time-complexity.
|
| FPBucketSort<T extends java.lang.Double> |
Requirement: Sort a list of floating-point numbers that are uniformly distributed over
a range, in "linear time".
|