Searched refs:pivot1 (Results 1 – 1 of 1) sorted by relevance
324 int pivot1 = a[e2]; in sort() local339 while (a[++less] < pivot1); in sort()364 if (ak < pivot1) { // Move a[k] to left part in sort()378 if (a[great] < pivot1) { // a[great] <= pivot2 in sort()395 a[left] = a[less - 1]; a[less - 1] = pivot1; in sort()410 while (a[less] == pivot1) { in sort()440 if (ak == pivot1) { // Move a[k] to left part in sort()450 if (a[great] == pivot1) { // a[great] < pivot2 in sort()460 a[less] = pivot1; in sort()772 long pivot1 = a[e2]; in sort() local[all …]