冒泡排序

 1 public class Solution
 2 {
 3     public void bubbleSort(int[] data)
 4     {
 5         for(int i = 0; i < data.length; i ++)
 6         {
 7             boolean hasExchange = false;
 8 
 9             for(int j = 0; j < data.length - i -1; j ++)
10             {
11                 if(data[j] > data[j + 1])
12                 {
13                     exchange(data, j, j + 1);
14                     
15                     hasExchange = true;
16                 }
17             }
18             
19             if(hasExchange == false)
20             {
21                 return;
22             }
23         }
24     }
25     public void exchange(int[] data, int m, int n)
26     {
27         int temp = data[m];
28         data[m] = data[n];
29         data[n] = data[m];
30     }
31 }