插入排序分析

int[] a = {2,21,3,8,5,4,6,9,7};
		int key = 0;
		for(int i=1;i<a.length;i++){
			key = a[i];	
			int j = i-1;

			for(;j>=0&&a[j]<key;j--){
				a[j+1] = a[j];
			}	
			a[j+1] = key;	
		}
		for(int i=0;i<a.length;i++){
			System.out.println(a[i]);
		}