笔记：冒泡排序

冒泡排序

public class demo1 {
    public static void main(String[] args) {
        int[] array = {3,5,45,5687,1,2345,13};
        System.out.println(Arrays.toString(new demo1().sort(array)));
    }
    //冒泡排序从小到大
    protected int[] sort(int[] arrayIn){
        //外循环 执行arrayIn.length-1次
        boolean flag = true;
        for (int i=0;i<=arrayIn.length-1;i++){

            //内循环排序，从a[0]开始对比到
            for (int n=0;n<=arrayIn.length-2-i;n++){
                if (arrayIn[n]>arrayIn[n+1]){
                    int temp = arrayIn[n];
                    arrayIn[n]= arrayIn[n+1];
                    arrayIn[n+1] = temp;
                    flag = false;
                }
            }
            if (flag){
                break;
            }
        }
        return arrayIn;
    }
}