| quickSort(double[], double[][], int, int, int) |  | 0% | | 0% | 15 | 15 | 54 | 54 | 1 | 1 |
| checkPartition(int[], double[], double, int, int, int, int) | | 0% | | 0% | 12 | 12 | 16 | 16 | 1 | 1 |
| quickSort(int[], double[], int, int, int) | | 0% | | 0% | 10 | 10 | 33 | 33 | 1 | 1 |
| insertionSort(double[], double[][], int, int, int) | | 0% | | 0% | 7 | 7 | 13 | 13 | 1 | 1 |
| insertionSort(int[], double[], int, int, int) | | 0% | | 0% | 6 | 6 | 10 | 10 | 1 | 1 |
| swap(int, int, double[], double[][]) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| reverse(int[], int, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| reverse(double[], int, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| sort(int[], double[], int, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| weightedAverageSorted(double, double, double, double) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| sort(double[], int, int, double[][]) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| weightedAverage(double, double, double, double) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| swap(int[], int, int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| maxSize(double, double, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| Z(double, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| maxSize(double, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| sort(int[], double[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| sort(double[], double[][]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| normalizer(double, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| sort(int[], double[], int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| reverse(int[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |