降序的插入排序

a[j]从右侧往左侧挪动。

package com.zzh;

import edu.princeton.cs.algs4.StdOut;

public class Solution{
	public static void main(String args[]) {
		int[] a= {3,44,38,5,47,15,36,26,27,2,46,4,19,50,48};
		int n=a.length;
		insertSort(a, n);
		for (int i = 0; i < n; i++) {
			StdOut.print(a[i]+" ");
		}
	}
	public static int[] insertSort(int[] a,int n) {
		for (int i = n-2; i >=0; i--) {
			int min=a[i];
			for (int j = i+1; j < n; j++) {
				if (min<a[j]) {
					a[j-1]=a[j];
					a[j]=min;
				}
			}
		}
		return a;
	}
}