排序
for (int i = 0; i < a.length - 1; i++) {
for (int j = i+1; j < a.length ; j++) {
if (a[i] > a[j]) {
int temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
for (int i = 0; i < a.length - 1; i++) {
for (int j = 0; j < a.length - 1 - i; j++) {
if (a[j] > a[j + 1]) {
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
public static void unckSort(int[] list,int low,int high) {
if(low < high) {
int middle = getMiddle(list,low,high);
unckSort(list,low,middle-1);
unckSort(list,middle+1,high);
}
}
public static int getMiddle(int[] list, int low, int high) {
int tmp = list[low];
while (low < high) {
while (low < high && list[high] > tmp) {
high--;
}
list[low] = list[high];
while (low < high && list[low] < tmp) {
low++;
}
list[high] = list[low];
}
list[low] = tmp;
return low;
}