人人皆知的冒泡排序

package com.haoran.array;

import java.util.Arrays;

public class bubblingDemo {
    public static void main(String[] args) {

        int[] a={5,4,3,2,1};
        bublingsprint(a);
        System.out.print("====================================="+"n");
        int[] b={1,2,3,4,5};
        bublingsprint(b);
    }

    public static void bublingsprint(int[] array) {
        for (int i = 0; i < array.length-1; i++) {
            //外层循环是 依次进行内层循环
            // array.length-1次因为最后一次不用比较
            // 剩下那个还没比较的一定是最小的
            boolean s=true;
            for (int j = 0; j array[j+1]){
                    int temp =0;
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                    s=false;

                }
                


            }if (s){
                System.out.println("已经是正序排列");
                break;

            }

            
        }
        System.out.println(Arrays.toString(array));
    }
}