Java 选择排序

选择排序(原理是将后面剩下最小<最大>的数放在最前面) 时间复杂度 O(n^2)

public class SelectSort{
	public static void main(String[] args) {
		int[] a = new int[20];
		Random r = new Random();
		for(int i=0;i<20;i++){
			a[i] = r.nextInt(100);
			System.out.print(a[i]+" ");
		}
		System.out.println();
		selectSort(a);
		for(int num : a){
			System.out.print(num+" ");
		}
	}
	
	public static void selectSort(int[] a){
		
		for(int i=0;i<a.length;i++){
			int maxSub = 0;
			int temp = 0;
			for(int j=0;j<a.length-i;j++){
				if(a[maxSub]<a[j]){
					maxSub = j;
				}
			}
			temp = a[maxSub];
			a[maxSub]=a[a.length-1-i];
			a[a.length-1-i]=temp;
		}
	}
	
}