数据结构之选择排序(泛型改造)

public class SelectionSort {
    private SelectionSort(){};
    //泛型方法，必须可比较的
    public static <E extends Comparable<E>> void sort(E[] arr){
        for (int i = 0; i < arr.length; i++) {
            int minIndex = i;
            //查找数组里面最小的那个数，进行无序查找
            for (int j = i; j < arr.length ; j++) {
                if (arr[j].compareTo(arr[minIndex]) < 0) {
                    minIndex = j;
                }
            }
            swap(arr,i,minIndex);
            //进行数据对换，进行有序

        }
    }
    private static <E> void swap(E[] arr,int i,int j ){
        E t = arr[i];
        arr[i] = arr[j];
        arr[j] = t;
    }

    public static void main(String[] args) {
        //接收的是泛型，这里的arr类型要改成Integer
        Integer[] arr = {5, 1, 6, 3, 4, 2, 7};
        SelectionSort.sort(arr);
        for (int i = 0; i < arr.length; i++) {
            if(i==0){
                System.out.print("[");
            }if(i < 6)
                System.out.print(arr[i] + ",");
            else {
                System.out.println(arr[i] + "]");
            }
        }
    }
}