冒泡排序

package cn.dingyi;/** * author:dingyi * time:2019/8/30 0030 11:17 */public class 冒泡排序 {    public static void main(String[] args) {        int[] a={4,7,23,54,1,9};        for (int i=0;i<a.length-1;i++){            for (int j=0;j<a.length-1-i;j++){                if(a[j]>a[j+1]){                    int c=a[j];                    a[j]=a[j+1];                    a[j+1]=c;                }            }        }        for (int num:a        ) {            System.out.println(num);        }    }}

来源：https://www.cnblogs.com/dingyi-boss/p/11434131.html