}
return;
}
-
int pivot = a[end];
int lo = start - 1;
int hi = end;
-
do {
while(a[++lo] < pivot) { }
while((hi > lo) && a[--hi] > pivot) { }
sortInts(a, start, lo-1);
sortInts(a, lo+1, end);
}
-
private static final void swapInts(int[] vec, int a, int b) {
if(a != b) {
int tmp = vec[a];