| mergeHi(int, int, int, int) |  | 0% | | 0% | 20 | 20 | 70 | 70 | 1 | 1 |
| mergeLo(int, int, int, int) | | 0% | | 0% | 20 | 20 | 66 | 66 | 1 | 1 |
| gallopLeft(long, long[], int, int, int, LongTimSort.LongComparator) | | 0% | | 0% | 12 | 12 | 33 | 33 | 1 | 1 |
| gallopRight(long, long[], int, int, int, LongTimSort.LongComparator) | | 0% | | 0% | 12 | 12 | 33 | 33 | 1 | 1 |
| mergeAt(int) | | 0% | | 0% | 5 | 5 | 21 | 21 | 1 | 1 |
| sort(long[], int, int, LongTimSort.LongComparator) | | 0% | | 0% | 7 | 7 | 25 | 25 | 1 | 1 |
| binarySort(long[], int, int, int, LongTimSort.LongComparator) | | 0% | | 0% | 7 | 7 | 20 | 20 | 1 | 1 |
| mergeCollapse() | | 0% | | 0% | 6 | 6 | 10 | 10 | 1 | 1 |
| countRunAndMakeAscending(long[], int, int, LongTimSort.LongComparator) | | 0% | | 0% | 7 | 7 | 10 | 10 | 1 | 1 |
| ensureCapacity(int) | | 0% | | 0% | 3 | 3 | 14 | 14 | 1 | 1 |
| LongTimSort(long[], LongTimSort.LongComparator) | | 0% | | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
| mergeForceCollapse() | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| rangeCheck(int, int, int) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| reverseRange(long[], int, int) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| minRunLength(int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| pushRun(int, int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| sort(long[], LongTimSort.LongComparator) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |