INSERTION-SORT

INSERTION-SORT
升序
FOR J = 2 TO A.length 
	key =  A[j]
	i = j  - 1
	while i > 0 and A[i] > key
		A[I + 1] = A[I]
		i = i - 1
	A[I + 1] = key 
Next
降序
for j = A.length - 1 to 1 step -1
	key = A[j]
	i = j + 1
	while i < A.length and A[i] < key
		A[i - 1] = A[i]
		i =i + 1
	A[i - 1] = key
next