java选择排序

public class 选择排序 {
    public static void main(String[] args) {
        int[]arr=new int[]{5,4,8,7,3,9,1};
        for (int i=0;i<arr.length-1;i++){
            for (int j=i+1;j<arr.length;j++){
                if (arr[j]<arr[i]){
                int temp=arr[i];
                arr[i]=arr[j];
                arr[j]=temp;
            }
            }
        }
        for (int i=0;i<arr.length;i++) {
            System.out.print(arr[i]);
        }

拆分选择排序算法：

 public static void main(String[] args) {
        int[] arr = new int[]{5, 4, 8, 7, 3, 9, 1};
        for (int j = 1; j < arr.length; j++) {
            if (arr[j] < arr[0]) {
                int temp = arr[0];
                arr[0] = arr[j];
                arr[j] = temp;

            }
        }
        for (int j = 2; j < arr.length; j++) {
            if (arr[j] < arr[1]) {
                int temp = arr[1];
                arr[1] = arr[j];
                arr[j] = temp;

            }
        }
        for (int j = 3; j < arr.length; j++) {
            if (arr[j] < arr[2]) {
                int temp = arr[2];
                arr[2] = arr[j];
                arr[j] = temp;

            }
        }
        for (int j = 4; j < arr.length; j++) {
            if (arr[j] < arr[3]) {
                int temp = arr[3];
                arr[3] = arr[j];
                arr[j] = temp;

            }
        }
        for (int j = 5; j < arr.length; j++) {
            if (arr[j] < arr[4]) {
                int temp = arr[4];
                arr[4] = arr[j];
                arr[j] = temp;

            }
        }
        for (int j = 6; j < arr.length; j++) {
            if (arr[j] < arr[5]) {
                int temp = arr[5];
                arr[5] = arr[j];
                arr[j] = temp;

            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
        }

    }
}