基本排序算法——选择排序

package com.example.demo.sort;

import java.util.Arrays;

/**
 * @Author: wangsj
 * @Date: 2021/8/17 14:23
 */
public class SelectSort {

    static void sort(int[] a) {
        int n = a.length;
        for (int i = 0; i < n; i++) {
            int tempMin = i; // 待比较元素索引
            for (int j = i + 1; j < n; j++) {
                // 待比较元素比被比较元素值大，记录当前索引准备替换
                if (a[tempMin] > a[j]) {
                    tempMin = j;
                }
            }

            int temp = a[i];
            a[i] = a[tempMin];
            a[tempMin] = temp;
        }
    }

    public static void main(String[] args) {
        int[] data = {1,23,12,12,5,15,14,31,52,51,4};
        sort(data);
        System.out.println(Arrays.toString(data));
    }
}