冒泡排序容易出现的错点总结

 1 public class maopao {
 2 
 3     public static void main(String[] args) {
 4         //冒泡排序
 5         int [] a = new int [] {23,43,56,78,111,234,8,9,};
 6         
 7         System.out.print("原始顺序：");
 8         
 9         for(int t:a)
10         {
11             System.out.print(t + " ");
12         }
13             System.out.println();
14             
15             int m = 0;
16             
17             //循环次数
18             
19             for(int j=0;j<a.length-1;j++)
20             {
21                 //前后比较循环
22                 for(int i=0;i<a.length-1-j;i++){
23                     //比较前后元素的大小排序
24                     if (a[i]>a[i+1]){
25                         
26                         //临时存放
27                         
28                         int b=a[i];
29                         
30                         a[i]=a[i+1];
31                         
32                         a[i+1]=b;
33                     }
34                     m++;
35                 }
36                 System.out.print((j+1)+"次循环:");
37                 
38                 for(int t:a)
39                 {
40                     System.out.print(t+" ");
41                 }
42                 System.out.println();
43             }
44             System.out.println("m = " + m);
45     }
46 }