数据结构

 1 public static void BubbleSort(int[] arr, int n) {
 2     boolean change = true;
 3     for(int i = 1; i <= n - 1 && change; i++){
 4         change = false;
 5         for(int j = 0; j < n - i; j++){
 6             if(arr[j] > arr[j + 1]) {
 7                 int temp = arr[j];
 8                 arr[j] = arr[j + 1];
 9                 arr[j + 1] = temp;
10                 change = true;
11             }
12         }      
13     }
14 }