打卡
Topic source快速排序,有些地方错了,下面是是真确的
private static void quickSort(int[] ns, int low, int high) {
int i, j, k, t;
if (low > high) {
return;
}
i = low;
j = high;
k = ns[low];//基准值 while (i < j) {
while (k >= ns[j] && i < j) {
j--;
}
while (k <= ns[i] && i < j) {
i++;
}
if (i < j) {
t = ns[j];
ns[j] = ns[i];
ns[i] = t;
}
}
k = ns[i];
ns[i] = ns[low];
ns[low] = k;
quickSort(ns, low, i - 1);
quickSort(ns, i + 1, high);
if (low == high) {
isRight(ns,"quickSort ");
}
}
- 1
YG嘿嘿