選擇排序

public class CheckSort {
    public static void main(String[] args) {
        System.out.println("選擇排序：");
        int[] arr = {12, 5, 2, 64, 75, 3, 23, 23, 5, 577, 86, 2, 244, 554, 235, 7, 5, 88, 9, 0};
        int len = arr.length;

        int[] arrSort = Sort(arr);
        for (int i = 0; i < len; i++) {
            System.out.print(arrSort[i] + "\t");
        }
        System.out.println();
    }

    public static int[] Sort(int[] arr) {
        int len = arr.length;
        for (int i = 0; i < len - 1; i++) {
            for (int j = i + 1; j < len; j++) {
                //if (arr[i] < arr[j]) { // 升序
                if (arr[i] < arr[j]) {   // 降序
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
        }
        return arr;
    }

}