java 选择排序

package com.mulun.sorting;

import java.util.Arrays;

/**
 * <h1>选择排序</h1>
 *
 * @author mulun
 */
public class SelectSort {
    public static void main(String[] args) {
        test2();
    }

    public static void test1() {
        int[] arr = {101, 34, 119, 1};
        selectSort(arr);

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

    public static void test2() {
        int[] arr = new int[80000];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) (Math.random() * 80000);
        }

        long start = System.currentTimeMillis();
        selectSort(arr);
        long end = System.currentTimeMillis();

        System.out.printf("所用时间：%d", (end - start));
        // 1533
    }

    /**
     * 时间复杂度O(n^2)
     */
    public static void selectSort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            // 最小值的索引
            int minIndex = i;
            // 临时保存最小值
            int min = arr[i];

            for (int j = i + 1; j < arr.length; j++) {
                if (min > arr[j]) {
                    min = arr[j];
                    minIndex = j;
                }
            }
            if (minIndex != i) {
                arr[minIndex] = arr[i];
                arr[i] = min;
            }

        }
    }
}