package com.imooc.ten;

import java.util.Arrays;

public class XuanZeRecursion {
	public static int[] selectionSort(int[] array,int minIndex) {
		int mid=minIndex;
        if (minIndex==array.length)
            return array;
            for (int j = minIndex+1; j < array.length; j++) {
                if (array[j] < array[minIndex]) //找到最小的数
                    minIndex = j; //将最小数的索引保存
            }
            int temp = array[minIndex];
            array[minIndex] = array[mid];
            array[mid] = temp;
        	System.out.println(Arrays.toString(array));
            selectionSort(array,++mid);
            return array;
        }
      

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		// TODO Auto-generated method stub
				int [] arr= {9,8,7,6,5,4,3,2,1};
				XuanZeRecursion xuanze=new XuanZeRecursion();
				xuanze.selectionSort(arr,0);
				System.out.println(Arrays.toString(arr));
	}

}