Java idea 选择排序

    package com.test;

    /**
     * 选择排序思想：
     * 从0索引开始，依次和后面元素比较，小的往前放，第一次完毕，最小值出现在了最小索引处
     */
    public class Test2 {
        public static void main(String[] args) {
            int[] arr = {9,8,0,1,5,3,2,6,4,10,15,11};
            System.out.print("排序前的数组为：");
            for (int num:arr){
                System.out.print(num + " ");
            }
            System.out.println();
            for (int i = 0; i < arr.length; i++){
                for (int j = i+1; j < arr.length; j++){
                    if(arr[i] > arr[j]){
                        int temp = arr[i];
                        arr[i] = arr[j];
                        arr[j] = temp;
                    }
                }
            }
            System.out.print("排序前的数组为：");
            for (int num:arr){
                System.out.print(num + " ");
            }
        }
    }