简单选择排序

public class SelectionSort {
    public static void main(String[] args){
        int a[] = {50,12,2,15,8,1,17};
        System.out.println("排序前：");
        for(int i = 0; i < a.length; i++){
            System.out.print(a[i] + " ");
        }
        
        //选择排序
        for(int i = 0; i < a.length; i++){
            int min = a[i];
            int n = i;  //最小值的索引
            //找出最小的值
            for(int j = i+1; j < a.length; j++){
                if(a[j] < min){
                    min = a[j];
                    n = j;
                }
            }
            //将最小的值和第一个值交换位置
            a[n] = a[i];
            a[i] = min;
            System.out.println("");
            System.out.println("第" + (i+1) + "次排序：");
            for(int k = 0; k < a.length; k++){
                System.out.print(a[k] + " ");
            }
        }
    }
}