【Java学习】选择排序的基本思想原理和Java代码实现（12）

从0索引开始，依次和后面元素比较，小的往前放，第一次完毕，最小值出现在了最小索引处

一步一步实现法：

package com.jingfei.paixu;

import java.util.Arrays;

public class Demo2 {
    public static void main(String[] args) {
        int[] arr = {10, 2, 0, -5, -10};
        for (int i = 1; i < arr.length; i++) {
            if (arr[0] > arr[i]) {
                int t = arr[0];
                arr[0] = arr[i];
                arr[i] = t;
            }
        }
        System.out.println(Arrays.toString(arr));

        for (int i = 2; i < arr.length; i++) {
            if (arr[1] > arr[i]) {
                int t = arr[1];
                arr[1] = arr[i];
                arr[i] = t;
            }
        }
        System.out.println(Arrays.toString(arr));
        for (int i = 3; i < arr.length; i++) {
            if (arr[2] > arr[i]) {
                int t = arr[2];
                arr[2] = arr[i];
                arr[i] = t;
            }
        }
        System.out.println(Arrays.toString(arr));

        for (int i = 4; i < arr.length; i++) {
            if (arr[3] > arr[i]) {
                int t = arr[3];
                arr[3] = arr[i];
                arr[i] = t;
            }
        }
        System.out.println(Arrays.toString(arr));

    }
}

---

简单实现，双层循坏

package com.jingfei.paixu;

import java.util.Arrays;

public class Demo2 {
    public static void main(String[] args) {

        //选择排序
        //将第一个数与后面的每个数比较，将小的（大的）放到前面，依次类推
        int[] arr = {10, 2, 0, -5, -10};
        for (int j = 0; j < arr.length - 1; j++) {
            for (int i = 1 + j; i < arr.length; i++) {
                if (arr[j] > arr[i]) {
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }

        }
        System.out.println(Arrays.toString(arr));
    }
}

[-10, -5, 0, 2, 10]

Process finished with exit code 0

---

谢谢！