public abstract class TimSorter extends Sorter
Sorter
implementation based on the
TimSort
algorithm.
This implementation is especially good at sorting partially-sorted arrays and sorts small arrays with binary sort.
NOTE:There are a few differences with the original implementation:
maxTempSlots
equal to half of the length of the slice of data to sort.
Modifier and Type | Method and Description |
---|---|
void |
sort(int from,
int to)
Sort the slice which starts at
from (inclusive) and ends at
to (exclusive). |
Copyright © 2010 - 2020 Adobe. All Rights Reserved