数据结构之选择排序

public class SelectionSort {
    private SelectionSort(){};
    public static int[] sort(int[] arr){
        for (int i = 0; i < arr.length; i++) {
            int minIndex = i;
            //查找数组里面最小的那个数，进行无序查找
            for (int j = i; j < arr.length ; j++) {
                if (arr[j] < arr[minIndex])
                    minIndex = j;
            }
            //进行数据对换，进行有序
            int temp;
            temp = arr[i];
            arr[i] = arr[minIndex];
            arr[minIndex] = temp;

        }
        return arr;
    }

    public static void main(String[] args) {
        int[] arr = {5, 1, 6, 3, 4, 2, 7};
        SelectionSort.sort(arr);
        int[] sort = SelectionSort.sort(arr);
        for (int i = 0; i < sort.length; i++) {
            if(i==0){
                System.out.print("[");
            }if(i < 6)
                System.out.print(sort[i] + ",");
            else {
                System.out.println(sort[i] + "]");
            }
        }
    }
}