Java中的直接排序

import java.util.Arrays;

//直接排序
//每一趟从待排序的数组中选出最小（最大）的元素，顺序的放在已排好序的最后，
//直到全部待排序的数据元素排完
//[63   4   24   1   3   15]
//[15   4   24   1   3 ] 63
//[15   4   3    1 ] 24  63
//[ 1   4   3 ]  15  24  63
//[ 1   3 ] 4    15  24  63
//[  1] 3   4    15  24  63
public class DirectorySort {
	public static void main(String []args){
		int []a={63,4,24,1,3,15};
		DirectorySort sorter=new DirectorySort ();
		sorter.sort(a);
	}
	public void sort(int[]a){
		int index;
		for(int i=1;i<a.length;i++){
			index=0;
			for(int j=1;j<=a.length-i;j++){
				if(a[j]>a[index]){
					index=j;
				}
			}
			int temp=a[a.length-i];
			a[a.length-i]=a[index];
			a[index]=temp;
			
			 System.out.println(Arrays.toString(a));
		}
		showArray(a);
		
		
	}
	
	public void showArray(int[]a){
		for(int i:a){
			System.out.println(i);
		}
	}
	
}
//输出结果
//[63, 4, 24, 1, 3, 15]
//[4, 24, 1, 3, 15, 63]
//[4, 1, 3, 15, 24, 63]
//[1, 3, 4, 15, 24, 63]
//[1, 3, 4, 15, 24, 63]
//[1, 3, 4, 15, 24, 63]
//[1, 3, 4, 15, 24, 63]
//1
//3
//4
//15
//24
//63