数组的冒泡排序

冒泡排序

代码

/**
 * 冒泡排序
 */
public class BubbleSort {
    public static void main(String[] args) {
        int[] arr = {9,2,6,85,41,22,100,99};
        //冒泡排序
        //外面循环7次
        for (int i = arr.length-1; i > 0; i--){
            //7,6,5,4,3,2,1
            for (int j = 0; j < i; j++){
                if (arr[j] > arr[j+1]){
                    //交换位置
                    int temp;
                    temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        //遍历数组
        for (int i = 0; i < arr.length ; i++) {
            System.out.print(arr[i]+"\t");
        }
    }
}

运行结果

2	6	9	22	41	85	99	100