java 选择排序

如果元素已经在该在的位置上就不需要再交换位置了。 

 

public class SelectDemo {
    public static void main(String[] args) {
        int[] arr = {1,3,5,7,9,2,4,6,8,0};
        sort(arr);
        for (int i: arr) {
            System.out.print(i+",");
        }
    }

    public static void sort(int[] arr){
        int min;
        for (int i = 0; i < arr.length-1; i++) {
            min = i;
            for (int j = i + 1; j < arr.length; j++) {
                if (arr[min] > arr[j]){
                    min = j;
                }
            }
            if (min != i){
                swap(arr,i,min);
            }
        }
    }

    public static void swap(int[] arr, int x, int y){
        int temp = arr[x];
        arr[x] = arr[y];
        arr[y] = temp;
    }
}