Searched refs:pivot (Results 1 – 3 of 3) sorted by relevance
479 int pivot = a[e3]; in sort() local502 if (a[k] == pivot) { in sort()506 if (ak < pivot) { // Move a[k] to left part in sort()511 while (a[great] > pivot) { in sort()514 if (a[great] < pivot) { // a[great] <= pivot in sort()527 a[k] = pivot; in sort()927 long pivot = a[e3]; in sort() local950 if (a[k] == pivot) { in sort()954 if (ak < pivot) { // Move a[k] to left part in sort()959 while (a[great] > pivot) { in sort()[all …]
249 Comparable pivot = (Comparable) a[start]; in binarySort() local262 if (pivot.compareTo(a[mid]) < 0) in binarySort()284 a[left] = pivot; in binarySort()
283 T pivot = a[start]; in binarySort() local296 if (c.compare(pivot, a[mid]) < 0) in binarySort()318 a[left] = pivot; in binarySort()