java冒泡排序

冒泡排序

public static viod main(String[] args){
    int[] a={23,44,55,3,12,31,56,24};
    for (int i=0;i<a.length-1;i++){
        for (int j=0;j<a.length-i-1;j++){
            if(a[j]>a[j+1]){
                int tmp=a[j];
                a[j]=a[j+1];
                a[j+1]=tmp;
            }
        }
    }
    
}