冒泡排序算法
package sf;
import java.lang.reflect.Array;
import java.util.Arrays;
public class BubbleSort {
public void bubbleSort(Integer[] args){
boolean flag = false;
Integer tmp ;
for(int i = 0 ; i < args.length ; i ++) {
flag = true;
for(int j = 0; j < args.length - i - 1 ; j++){
if(args[j] > args[j+1]){
tmp = args[j];
args[j] = args[j + 1];
args[j + 1] = tmp;
flag = false;
}
}
if(flag) break;;
}
}
public static void main(String[] args){
Integer arr[] = {2, 4, 7, 6, 8, 5, 9};
BubbleSort bubbleSort = new BubbleSort();
bubbleSort.bubbleSort(arr);
System.out.println(Arrays.toString(arr));
}
}