| trIntroSort(int, int, int, int, int, Bzip2DivSufSort.TRBudget, int) |  | 0% | | 0% | 90 | 90 | 247 | 247 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ssMultiKeyIntroSort(int, int, int, int) | | 0% | | 0% | 46 | 46 | 120 | 120 | 1 | 1 |
| sortTypeBstar(int[], int[]) | | 0% | | 0% | 48 | 48 | 99 | 99 | 1 | 1 |
| lsIntroSort(int, int, int, int, int) | | 0% | | 0% | 44 | 44 | 96 | 96 | 1 | 1 |
| ssMergeBackward(int, int[], int, int, int, int, int) | | 0% | | 0% | 23 | 23 | 80 | 80 | 1 | 1 |
| ssMerge(int, int, int, int, int[], int, int, int) | | 0% | | 0% | 25 | 25 | 76 | 76 | 1 | 1 |
| trPartition(int, int, int, int, int, int) | | 0% | | 0% | 27 | 27 | 41 | 41 | 1 | 1 |
| constructBWT(int[], int[]) | | 0% | | 0% | 19 | 19 | 41 | 41 | 1 | 1 |
| ssMergeForward(int, int[], int, int, int, int, int) | | 0% | | 0% | 13 | 13 | 37 | 37 | 1 | 1 |
| subStringSort(int, int, int, int[], int, int, int, boolean, int) | | 0% | | 0% | 12 | 12 | 28 | 28 | 1 | 1 |
| ssMedian5(int, int, int, int, int, int, int) | | 0% | | 0% | 7 | 7 | 49 | 49 | 1 | 1 |
| trMedian5(int, int, int, int, int, int, int, int) | | 0% | | 0% | 7 | 7 | 48 | 48 | 1 | 1 |
| ssHeapSort(int, int, int, int) | | 0% | | 0% | 6 | 6 | 18 | 18 | 1 | 1 |
| lsSort(int, int, int) | | 0% | | 0% | 10 | 10 | 27 | 27 | 1 | 1 |
| ssCompareLast(int, int, int, int, int) | | 0% | | 0% | 13 | 13 | 19 | 19 | 1 | 1 |
| trHeapSort(int, int, int, int, int) | | 0% | | 0% | 6 | 6 | 17 | 17 | 1 | 1 |
| trPivot(int, int, int, int, int) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| ssSubstringPartition(int, int, int, int) | | 0% | | 0% | 7 | 7 | 15 | 15 | 1 | 1 |
| ssPivot(int, int, int, int) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| ssFixdown(int, int, int, int, int) | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| trCopy(int, int, int, int, int, int, int) | | 0% | | 0% | 7 | 7 | 15 | 15 | 1 | 1 |
| trSort(int, int, int) | | 0% | | 0% | 7 | 7 | 17 | 17 | 1 | 1 |
| trFixdown(int, int, int, int, int, int) | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| ssCompare(int, int, int) | | 0% | | 0% | 7 | 7 | 10 | 10 | 1 | 1 |
| trInsertionSort(int, int, int, int, int) | | 0% | | 0% | 7 | 7 | 11 | 11 | 1 | 1 |
| ssMedian3(int, int, int, int, int) | | 0% | | 0% | 4 | 4 | 17 | 17 | 1 | 1 |
| lsUpdateGroup(int, int, int) | | 0% | | 0% | 8 | 8 | 16 | 16 | 1 | 1 |
| ssInsertionSort(int, int, int, int) | | 0% | | 0% | 7 | 7 | 11 | 11 | 1 | 1 |
| trMedian3(int, int, int, int, int, int) | | 0% | | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
| trLog(int) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| bwt() | | 0% | | 0% | 4 | 4 | 14 | 14 | 1 | 1 |
| ssMergeCheckEqual(int, int, int) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| trGetC(int, int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| ssLog(int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| ssBlockSwap(int[], int, int[], int, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| swapElements(int[], int, int[], int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| Bzip2DivSufSort(byte[], int[], int) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getIDX(int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| BUCKET_B(int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| BUCKET_BSTAR(int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |