Lines Matching refs:lo
27 protected void quickSort(int lo, int hi) {
28 quickSortHelper(lo, hi);
29 insertionSort(lo, hi);
32 private void quickSortHelper(int lo, int hi) {
34 int diff = hi - lo;
38 int i = (hi + lo) / 2;
39 if (compare(lo, i) > 0) {
40 swap(lo, i);
42 if (compare(lo, hi) > 0) {
43 swap(lo, hi);
50 i = lo;
65 if (j - lo <= hi - i + 1) {
66 quickSortHelper(lo, j);
67 lo = i + 1;
75 private void insertionSort(int lo, int hi) {
76 for (int i = lo + 1 ; i <= hi; i++) {
77 for (int j = i; j > lo; j--) {
87 protected void mergeSort(int lo, int hi) {
88 int diff = hi - lo;
90 insertionSort(lo, hi);
93 int mid = lo + diff / 2;
94 mergeSort(lo, mid);
96 merge(lo, mid, hi, mid - lo, hi - mid);
99 private void merge(int lo, int pivot, int hi, int len1, int len2) {
104 if (compare(pivot, lo) < 0) {
105 swap(pivot, lo);
113 first_cut = lo + len11;
119 first_cut = upper(lo, pivot, second_cut);
120 len11 = first_cut - lo;
124 merge(lo, first_cut, new_mid, len11, len22);
128 private void rotate(int lo, int mid, int hi) {
129 int lot = lo;
138 lot = lo; hit = hi - 1;
144 private int lower(int lo, int hi, int val) {
145 int len = hi - lo;
148 int mid= lo + half;
150 lo = mid + 1;
156 return lo;
159 private int upper(int lo, int hi, int val) {
160 int len = hi - lo;
163 int mid = lo + half;
167 lo = mid + 1;
171 return lo;