数组排序,选择排序法

package com.pang.array_demo;

import java.util.Arrays;

public class Array_Demo {
    public static void main(String[] args) {
        int[] arr = { 1, 5, 3, 23, 3, 45 };
        arraySort(arr);
        arrayDesc(arr);
    }
    //正序
    public static void arraySort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = i+1 ; j < arr.length; j++) {
                if (arr[i] > arr[j]) {
                    int t = arr[i];
                    arr[i] = arr[j];
                    arr[j] = t;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
    //倒序
    public static void arrayDesc(int[] arr){
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = i+1 ; j < arr.length; j++) {
                if (arr[i] < arr[j]) {
                    int t = arr[i];
                    arr[i] = arr[j];
                    arr[j] = t;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}