def insert_sort(lists):
lengh = len(lists)
for i in range(1,lengh):
for j in range(i,0,-1):
if lists[j] < lists[j-1]:
lists[j], lists[j-1] = lists[j-1], lists[j]
alist = [54, 26, 93, 17, 77, 31, 44, 55, 20]
insert_sort(alist)
print(alist)
# [17, 20, 26, 31, 44, 54, 55, 77, 93]
最优时间复杂度:O(n) (升序排列,序列已经处于升序状态)
最坏时间复杂度:O(n^2)
稳定性:稳定