冒泡排序

        //冒泡排序
        //1.定义一个数组存储数据
        int [] arr= {1, 2, 5, 0};
        //2.定义一个循环控制比较轮数
        for (int i = 0; i < arr.length -1; i++) {
            //3.定义一个循环控制比较的次数
            for (int j = 0; j < arr.length -i-1; j++) {
                if (arr[j] >arr[j+1]){
                    int temp = arr[j+1];
                    arr[j+1] =arr[j];
                    arr[j] = temp;
                }
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + "\t");
        }