Lines Matching refs:lo
643 int lo = lo0;
646 // pause(lo, hi);
647 if (lo >= hi)
651 else if (lo == hi - 1)
657 if (a[lo] > a[hi])
659 int T = a[lo];
661 a[lo] = a[hi];
671 int pivot = a[(lo + hi) / 2];
673 a[(lo + hi) / 2] = a[hi];
676 while (lo < hi)
680 * Search forward from a[lo] until an element is found that
681 * is greater than the pivot or lo >= hi
683 while (a[lo] <= pivot && lo < hi)
685 lo++;
690 * is less than the pivot, or lo >= hi
692 while (pivot <= a[hi] && lo < hi)
698 * Swap elements a[lo] and a[hi]
700 if (lo < hi)
702 int T = a[lo];
704 a[lo] = a[hi];
722 * Recursive calls, elements a[lo0] to a[lo-1] are less than or
726 sort(a, lo0, lo - 1);
