| Class | Description |
|---|---|
| BottomUpMergeSort<T extends java.lang.Comparable> |
BottomUpMergeSort treats the input array as a cluster of sub-lists and iteratively merges them
back and forth b/n 2 buffers to produce a sorted list.
|
| MergeSort<T extends java.lang.Comparable> |
A general-purpose stable sort algorithm with a guaranteed time complexity of O(nlogn) and O(n) space. Inventor: John Von Neumann Reference 1 Reference 2 |
| TopDownMergeSort<T extends java.lang.Comparable> |
TopDownMergeSort recursively splits the array into sub-lists and merges them to produce a
sorted list.
|