MENU

数组排序案例

• November 14, 2020 • 面向对象编程

数组排序案例

过程

思路

​ 把剩余最大的往后面排

源代码

public class Main {
    public static void main(String[] args) throws SQLException {
        int[] arr = new int[]{8,9,0,2,3,5,10,7,6,1};
        System.out.print("排序前:");
        print(arr);
        System.out.println("--------------------------------");
        order(arr);
        System.out.println("--------------------------------");
        System.out.print("排序后:");
        print(arr);
    }

    /**
     * 冒泡排序算法
     * */
    public static void order(int a[]){
        int len = a.length;
        //共排len-1次
        for (int i = 0; i < len-1; i++) {
            System.out.print("第"+(i+1)+"次排序结果:");
            for (int j = 0; j < len - 1 - i; j++) {
                if(a[j]>a[j+1]){
                    int temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                }
            }
            //输出每次排序后的效果
            print(a);
        }
    }

    //遍历输出数组
    public static void print(int a[]){
        for (int temp : a) {
            System.out.print(temp+" ");
        }
        System.out.println();
    }
}

运行结果

采用冒泡排序

<center> 动图来自:https://blog.csdn.net/wfq784967698/article/details/79551476<;/center>


代码编译器:IntelliJ IDEA 2020.02

Archives QR Code Tip
QR Code for this page
Tipping QR Code