重学算法之选择排序

package com.hy.sort.selectionsort;

import java.util.Arrays;

/**
 * @author hanyong
 * @date 2020/11/3 23:41
 */
public class SelectionSort {
    /**
     * 大于0说明c1大与c2
     *
     * @param c1
     * @param c2
     * @return
     */
    private boolean isBigger(Comparable c1, Comparable c2) {
        return c1.compareTo(c2) > 0;
    }

    /**
     * 交换数组对应索引的值
     *
     * @param comparables
     * @param i
     * @param j
     */
    private void exchange(Comparable[] comparables, int i, int j) {
        Comparable temp = comparables[i];
        comparables[i] = comparables[j];
        comparables[j] = temp;
    }

    /**
     * 选择排序实现
     * @param comparables
     */
    private void selectionSort(Comparable[] comparables) {
        //假定的最小值索引由0依次递增，可以到到数第二个
        for (int i = 0; i <= comparables.length - 2; i++) {
            //假设本次的最小值索引为i
            int minIndex = i;
            for (int j = i + 1; j <= comparables.length - 1; j++) {
                if (isBigger(comparables[minIndex], comparables[j])) {
                    //更换最小值索引
                    minIndex = j;
                }
                exchange(comparables, i, minIndex);
            }

        }
    }

    public static void main(String[] args) {
        Integer[] numbs = {4, 3, 6, 10, 9, 8};
        SelectionSort selectionSort = new SelectionSort();
        selectionSort.selectionSort(numbs);
        System.out.println(Arrays.toString(numbs));
    }
}