Java实现冒泡排序算法

int[] array = {56, 15, 10, 69, 1, 21, 6, 85, 30, 45, 73, 93}; 
     
    //冒泡排序 
    for (int i = 0; i < array.length; i++) { 
      for (int j = i+1; j < array.length; j++) { 
        if (array[i] >= array[j]) { 
          int temp = array[i]; 
          array[i] = array[j]; 
          array[j] = temp; 
        } 
      } 
    } 
     
    System.out.print("冒泡排序的结果是： "); 
    for (int i : array) { 
      System.out.print(i + " "); 
    }