排序算法

选择排序

package SelectionSort;

import java.util.Arrays;

/*
    选择排序
 */
public class SelectionSort {
    private SelectionSort(){}

    public static void sort(int[] nums) {
        for (int i=0;i<nums.length;i++) {

            int minIndex = i;
            for (int j=i;j<nums.length;j++) {
                if (nums[j] < nums[minIndex]) {
                    minIndex = j;
                }
            }
            swap(nums,i,minIndex);
        }
    }
    private static void swap(int[] nums,int i,int mindex) {
        int tmp = nums[i];
        nums[i] = nums[mindex];
        nums[mindex] = tmp;
    }

    public static void main(String[] args) {

        int[] nums = {1,4,2,3,6,5};
        sort(nums);
        System.out.println(Arrays.toString(nums));;
    }
}