冒泡排序

public class test {    public static void main(String[] args) {        //冒泡排序        int[] arr={4,66,123,44,22,677,88,2};        for (int i = 0; i < arr.length; i++) {//做n-1次排序 一共需要几次循环            for (int j = 0; j < arr.length-1; j++) {//内层控制每一趟的循环次数                if(arr[j]>arr[j+1]){                    int temp=arr[j];                    arr[j]=arr[j+1];                    arr[j+1]=temp;                }            }        }        for (int j = 0; j < arr.length; j++) {            System.out.print(arr[j]+" ");        }    }