冒泡排序
public static void bubbling (int[] num2) {
int temp;
for (int i = 0; i < num2.length; i ++) {
for (int j = 0; j < num2.length; j ++) {
if (num2[i] < num2[j]) {
temp = num2[i];
num2[i] = num2[j];
num2[j] = temp;
}
}
}
}
快速排序
public static void quick(int[] num1,int start,int end) {
int i,j,t,temp;
if (start>end) {
return;
}
i = start;
j = end;
temp = num1[start];
while (i<j) {
while (i<j && temp <= num1[j]) {
j--;
}
while (i<j && temp >= num1[i]) {
i++;
}
if (i < j) {
t = num1[j];
num1[j] = num1[i];
num1[i] = t;
}
}
num1[start] = num1[i];
num1[i] = temp;
quick(num1, start , j-1);
quick(num1, j+1, end);
}