冒泡法輸出的結(jié)果沒(méi)變化
package com.imooc;
public class test111 {
public static void main(String[] args) {
int[] arr = { 24, 69, 80, 57, 13 };
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
swap(arr[j], arr[j + 1]);
}
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
public static void swap(int a, int b) {
if (a > b) {
int temp;
temp = a;
a = b;
b = temp;
}
}
}
2016-07-21
for（int i=0;i<arr.length;i++）{
for(int j=0;j<arr.length;j++){
if(arr[j]>arr[j+1]){
int temp;
temp = arr[ j ];
arr[ j ] =arr [ j+1 ];
arr[ j+1] =temp;
}
}
}
2016-07-21
把兩個(gè)for 寫(xiě)public static void swap（）{}方法里去