给定一个整型数组, 实现冒泡排序(升序排序)优化后

冒泡排序(升序排序)

import java.util.Arrays;
public class TestDemo {
    //冒泡排序
    public static void bubbleSort(int[] array){
        for (int i = 0; i < array.length-1 ; i++) {
            boolean sort = true;
            for (int j = 0; j < array.length-i-1; j++) {
                if(array[j] > array[j+1]){
                    int tmp = array[j+1];
                    array[j+1] =array[j];
                    array[j] = tmp;
                    sort = false;
                }
            }
            if (sort){
                break;
            }
        }
    }
    public static void main1(String[] args) {
        int[] array = {1,2,3,10,5,6};
        bubbleSort(array);
        System.out.println(Arrays.toString(array));
    }
}