def insertionsort(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#compare with the digital in front of i A[i+1]=key A=[15,2,4,6,1,3,12,45] insertionsort(A)print(A)
输出结果:
[1, 2, 3, 4, 6, 12, 15, 45]
算法导论学习-插入排序python实现
最新推荐文章于 2022-08-29 14:58:01 发布