public abstract class InPlaceMergeSorter extends Sorter
Sorter
implementation based on the merge-sort algorithm that merges
in place (no extra memory will be allocated). Small arrays are sorted with
insertion sort.BINARY_SORT_THRESHOLD
Constructor and Description |
---|
InPlaceMergeSorter()
Create a new
InPlaceMergeSorter |
Modifier and Type | Method and Description |
---|---|
(package private) void |
mergeSort(int from,
int to) |
void |
sort(int from,
int to)
Sort the slice which starts at
from (inclusive) and ends at
to (exclusive). |
binarySort, binarySort, checkRange, compare, comparePivot, doRotate, heapChild, heapify, heapParent, heapSort, lower, lower2, mergeInPlace, reverse, rotate, setPivot, siftDown, swap, upper, upper2
public InPlaceMergeSorter()
InPlaceMergeSorter