传统的冒泡排序（一）

小懒快要丑哭啦

已于 2022-10-25 11:28:10 修改

阅读量101

点赞数

文章标签：算法 java 排序算法

于 2022-10-25 11:23:58 首次发布

本文链接：https://blog.csdn.net/Mr_PGZ/article/details/127510032

版权

public class BubbleSort{
    public static void main(String[] args) {
        int arr[] = {6, 4, 8, 2, 65, 45, 1};
        int temp;
        System.out.println("原始数组：");
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
        for (int i = 0; i < arr.length - 1; i++) {
            System.out.println("第" + (i + 1) + "次循环：");
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
                for (int m = 0; m < arr.length; m++) {
                    System.out.print(arr[m] + " ");
                }
                System.out.println();
            }
        }
        System.out.println("排序后数组：");
        for (int m = 0; m < arr.length; m++) {
            System.out.print(arr[m] + " ");
        }
        System.out.println();
    }
}