| Interface | Description |
|---|---|
| MedianFinder<T extends java.lang.Comparable> |
Given an array A = A[1,...,n] and an index kMax (1 ≤ kMax ≤ n), find the kth smallest element of A. Reference 1 Reference 2 |
| QuickSelect<T extends java.lang.Comparable> |
Find kth largest/smallest element in an unsorted array, in Linear time as average-case.
|