数组排序

转载于 2018-09-08 17:21:52 发布 · 215 阅读

文章标签：

#array #arr

JAVA 专栏收录该内容

30 篇文章

订阅专栏

冒泡排序

public static void main(String[] args) {
    int[] arr= {2, 546, 73, 28, 65, 235, 72, 5, 89};;
    for (int i = 1; i < arr.length; i++) {
        for (int j = 0; j < arr.length-i-1; j++) {
            if (arr[j]>arr[j+1]) {
                arr[j] = arr[j]+arr[j+1];
                arr[j+1] = arr[j]-arr[j+1];
                arr[j] = arr[j]-arr[j+1];
            }
        }
    }
    for (int j : arr) {
        System.out.println(j);
    }
}

选择排序

public static void main(String[] args) {
        int[] arr= {2, 546, 73, 28, 65, 235, 72, 5, 89};
        for (int i = 0; i < arr.length-1; i++) {
            for (int j = i+1; j < arr.length; j++) {
                if (arr[i] > arr[j]) {
                    arr[i] = arr[i] + arr[j];
                    arr[j] = arr[i] - arr[j];
                    arr[i] = arr[i] - arr[j];
                }
            }
        }
        for (int i : arr) {
            System.out.println(i);
        }
    }

工具类

public static void main(String[] args) {    
    int[] arr= {2, 546, 73, 28, 65, 235, 72, 5, 89};
    Arrays.sort(arr);   
    for (int i : arr) {
        System.out.println(i);
    }   
}