QSortAlgorithmpublic class QSortAlgorithm extends SortAlgorithm A quick sort demonstration algorithm
SortAlgorithm.java, Thu Oct 27 10:32:35 1994 |
Methods Summary |
---|
void | sort(int[] a, int lo0, int hi0)
int lo = lo0;
int hi = hi0;
pause(lo, hi);
if (lo >= hi) {
return;
}
int mid = a[(lo + hi) / 2];
while (lo < hi) {
while (lo<hi && a[lo] < mid) {
lo++;
}
while (lo<hi && a[hi] > mid) {
hi--;
}
if (lo < hi) {
int T = a[lo];
a[lo] = a[hi];
a[hi] = T;
lo++;
hi--;
pause();
}
}
if (hi < lo) {
int T = hi;
hi = lo;
lo = T;
}
sort(a, lo0, lo);
sort(a, lo == lo0 ? lo+1 : lo, hi0);
| void | sort(int[] a)
sort(a, 0, a.length-1);
|
|