Searched refs:pivot2 (Results 1 – 1 of 1) sorted by relevance
325 int pivot2 = a[e4]; in sort() local340 while (a[--great] > pivot2); in sort()372 } else if (ak > pivot2) { // Move a[k] to right part in sort()373 while (a[great] > pivot2) { in sort()396 a[right] = a[great + 1]; a[great + 1] = pivot2; in sort()414 while (a[great] == pivot2) { in sort()444 } else if (ak == pivot2) { // Move a[k] to right part in sort()445 while (a[great] == pivot2) { in sort()773 long pivot2 = a[e4]; in sort() local788 while (a[--great] > pivot2); in sort()[all …]