Lines Matching refs:right
27 int left=0, right=max-1;
28 while (left <= right) {
29 int mid = ((right-left)/2)+left;
34 right = mid -1;
64 int right,
69 swap2(a,b,p,right); // Move pivot to end
71 for (i=left; i<right; i++) {
77 swap2(a,b,right,p); // Move pivot to its final place
88 int right
90 while (right > left) {
91 int p = left + (right-left)/2; //select a pivot
92 p = partition(a,b, left, right, p);
93 if ((p-1) - left < right - (p+1)) {
97 qsort_arr(a,b, p+1, right);
98 right = p-1;
145 // The second pattern needs to be a right side match of the first
