冒泡排序的方法

ShiKi_only

于 2022-05-19 17:39:42 发布

阅读量156

点赞数

文章标签：蓝桥杯 java leetcode

本文链接：https://blog.youkuaiyun.com/ShiKi_only/article/details/124863959

版权

public class Order {
    public static void main(String[] args) {
        int ccc[] = {9, 2, 3, 7, 5, 6};
        int chao;
        for (int a = 0; a < ccc.length; a++) {
            for (int b = 0; b < ccc.length - 1; b++) {
                if (ccc[b] > ccc[b + 1]) {
                    chao = ccc[b];
                    ccc[b] = ccc[b + 1];
                    ccc[b + 1] = chao;
                }
            }
        }
        for (int a = 0; a < ccc.length; a++) {
            System.out.println(ccc[a]);
        }
    }
}