2021-03-31

最新推荐文章于 2021-10-21 18:38:21 发布

kligfc

最新推荐文章于 2021-10-21 18:38:21 发布

阅读量80

点赞数

分类专栏：笔记

本文链接：https://blog.youkuaiyun.com/kligfc/article/details/115358109

版权

笔记专栏收录该内容

9 篇文章

订阅专栏

冒泡排序

/**
 * @kligfc
 * 2021/3/27
 */
public class BubbleSort {
    public static void main(String[] args) {
        int []data1 = new int[]{1,2,9,7,3};
        int tamp = 0;
        for (int i = 0; i < data1.length; i++) {
            flags = false;
            for (int j = 0; j < data1.length - 1 -i; j++) {
                if (data1[j] > data1[j + 1]){
                    tamp = data1[j];
                    data1[j] = data1[j + 1];
                    data1[j + 1] = tamp;
                }

            }
        }
        System.out.println("冒泡排序结果");
        for (int i = 0; i < data1.length; i++) {
            System.out.println(data1[i]);
        }
    }
}

优化后


/**
 * @kligfc
 * 2021/3/27
 */
public class BubbleSort {
    public static void main(String[] args) {
        int []data1 = new int[]{1,2,9,7,3};
        int tamp = 0;
        boolean flags = false;
        for (int i = 0; i < data1.length; i++) {
            flags = false;
            for (int j = 0; j < data1.length - 1 -i; j++) {
                if (data1[j] > data1[j + 1]){
                    tamp = data1[j];
                    data1[j] = data1[j + 1];
                    data1[j + 1] = tamp;
                    flags = true;
                }

            }
            if (flags = false){
                break;
            }//减少无用运算
        }
        System.out.println("冒泡排序结果");
        for (int i = 0; i < data1.length; i++) {
            System.out.println(data1[i]);
        }
    }
}