插入排序算法,平均时间复杂度 O(n²)
python 实现:
import random
A=[x for x in range(10000)]
random.shuffle(A)
for j in range(1,len(A)):
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
print A
月影斑驳
Article
大江深处月明时,一夜吟君小律诗。应有水仙潜出听,翻将唱作步虚词。