2021-11-05Java实现选择排序

package com.atguigu.Sort;

import java.util.Arrays;

/**
 * 选择排序
 * @author shkstart
 * @create 2021 -09-30 14:03
 */
public class SelectSort {
    public static void main(String[] args) {
//        int[] arr = {101,34,119,1,123,376};
       // 创建要给80000个数据的数组
        int[] arr = new int[80000];
        for(int i = 0;i < 80000;i++){
            arr[i] = (int)(Math.random()*(800000 - 0 + 1));
        }
//        System.out.println("排序前");
//        System.out.println(Arrays.toString(arr));
        long start = System.currentTimeMillis();
         selectSort(arr);
         long end = System.currentTimeMillis();
        System.out.println("选择排序所花的时间：" + (end - start));
//        System.out.println("排序后");
//        System.out.println(Arrays.toString(arr));
    }
    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];//重置min
                    minIndex = j;//重置minIndex
            }

            }
            if(minIndex!=i){
                arr[minIndex] = arr[i];
                arr[i] = min;
            }
//            System.out.println("第"+(i+1)+"轮后~~");
//            System.out.println(Arrays.toString(arr));
        }
    }

}