private void maopao() {
// TODO Auto-generated method stub
int[] arr = { 32, 22, 1, 24, 66, 75, 3 };
for (int w = 1; w < arr.length; w++) {
for (int i = 0; i < arr.length - w; i++) {
if (arr[i] > arr[i + 1]) {
int temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
}
}
}
for (int i : arr) {
System.out.println(i);
}
}
冒泡排序,当初我一直是用这种方法的..
然后发现java居然有自带对数组排序的工具
private void sort() {
// TODO Auto-generated method stub
int[] arr = { 32, 22, 1, 24, 66, 75, 3 };
Arrays.sort(arr);
for (int i : arr) {
System.out.println(i);
}
}
emmmm,