8-咸鱼学Java-冒泡排序算法优化

先上代码

import java.util.Arrays;

public class maopaoyouhua {
    public static void maopao(int[] a)
    {   long start =System.currentTimeMillis();
        int temp;
        boolean t = true; //添加标志位，如果算法已经是有序，则不需要继续
        int count = 0;
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a.length-1-i; j++) {
                if(a[j]>a[j+1])
                {
                    temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                    t = false;
                    count++;
                }
            }
            if(t)
            break;
        }
        System.out.println("消耗时间"+(System.currentTimeMillis()-start));
        System.out.println("进行"+count+"次比较");
    }
    public static void main(String[] args) {
        int[] array1 = {1,2,3,5,6,3,2,1};
        int[] array2 = {1,2,3,4,5,6,7,8};
        System.out.println("array1");
        System.out.println(Arrays.toString(array1));
        maopao(array1);
        System.out.println(Arrays.toString(array1));
        System.out.println("=========================");
        System.out.println("array2");
        System.out.println(Arrays.toString(array2));
        maopao(array2);
        System.out.println(Arrays.toString(array2));
    }
}

结果
array1
[1, 2, 3, 5, 6, 3, 2, 1]
消耗时间0
进行12次比较
[1, 1, 2, 2, 3, 3, 5, 6]
=========================
array2
[1, 2, 3, 4, 5, 6, 7, 8]
消耗时间0
进行0次比较
[1, 2, 3, 4, 5, 6, 7, 8]
有效的降低了在排序有序数列时候的时间复杂度。