算法导论Python实现

算法导论第三版书内的算法Python实现

 

 1 def insertion_sort(A):
 2     """这是第一个算法，插入排序"""
 3     for j in range(1, len(A)):
 4         key = A[j]
 5         i = j - 1
 6         while i >= 0 and A[i] > key:
 7             A[i + 1] = A[i]
 8             i -= 1
 9         A[i + 1] = key
10 
11 
12 alist = [1, 2, 3, 4, 5]
13 insertion_sort(A=alist)

 

posted @ 2022-01-20 22:39  王亚许  阅读(64)  评论(0)    收藏  举报