INSERTION-SORT(A)
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
插入排序
原文：https://www.cnblogs.com/1521299249study/p/11758382.html
