冒泡排序

冒泡排序

代码块

 public class BubbleSort {
    public static void main(String[] args) {
        int[] arrays = new int[] {5,8,7,96,1,3,4};
        System.out.print("排序前：");
        for(int x = 0 ; x<arrays.length();x++) {
           System.out.print(arrays[x]);
        }
        for(int i =0;i<arrays.length()-1;i++) {
           for(int n = 0 ; n <arrays.length()-1;n++) {
                if(arrays[i]>arrays[i+1]){           
                     int temp = arrays[i];
                     arrays[i] = arrays[i+1];
                     arrays[i+1] = temp;                                  
                }     
           }
           System.out.print("排序后：");
         for(int x =0 ; x<arrays.length();x++) {
             System.out.print(arrays[x]);
         }
       }
   }               
}