冒泡排序算法

最新推荐文章于 2025-05-23 08:55:07 发布

希留耶的猫

最新推荐文章于 2025-05-23 08:55:07 发布

阅读量124

点赞数

文章标签：算法 java 数据结构

本文链接：https://blog.youkuaiyun.com/weixin_45724787/article/details/126287389

版权

java冒泡排序算法

代码实现

public class BubbleSearch2 {
    public static void main(String[] args) {
        int[] sum = {1, 2, 36, 5, 15, 44, 65, 99, 95};
        bubble(sum);
    }

    private static void bubble(int[] sum) {
        for (int k = 0; k < sum.length - 1; k++) {
            boolean flag = false;
            for (int i = 0; i < sum.length - 1 - k; i++) {
                if (sum[i] > sum[i + 1]) {
                    swap(sum, i, i + 1);
                    flag = true;
                }
            }
            if (flag == false) break;
        }
        System.out.println(Arrays.toString(sum));
    }
    
    private static void swap(int[] sum, int i, int j) {
        int temp = sum[i];
        sum[i] = sum[j];
        sum[j] = temp;
    }
}

改进版本

public class BubbleSearch2 {
    public static void main(String[] args) {
        int[] sum = {1, 2, 36, 5, 15, 44, 65, 99, 95};
        bubblev2(sum);
    }


    private static void bubblev2(int[] sum) {
        int n = sum.length - 1;
        while (true) {
            int last = 0;
            for (int i = 0; i < n; i++) {
                if (sum[i] > sum[i + 1]) {
                    swap(sum, i, i + 1);
                    last = i;
                }
            }
            n = last;
            if (n == 0) break;
        }
        System.out.println(Arrays.toString(sum));
    }

    private static void swap(int[] sum, int i, int j) {
        int temp = sum[i];
        sum[i] = sum[j];
        sum[j] = temp;
    }
}