冒泡排序

public static void main(String []args){
 int [] a = new int [5,8,426,841,258,156,54]
}

public void paixu(int [] a){
    
    for(int i=1;i<a.length-1;i++){
    for(int j=1;j<a.length-1-j;j++){
    int temp;
    if (a[j]<a[j-1]){
       temp = a[j-1]
       a[j-1] = a[j]
       a[j-1] = temp
    }
     }
    }
}