https://www.mayuan.site/tags/%E6%8E%92%E5%BA%8F/ Recent content in 排序 on Prime's blog Hugo -- gohugo.io en Thu, 05 Dec 2019 09:59:35 +0800 https://www.mayuan.site/post/%E7%AE%97%E6%B3%95/%E6%8E%92%E5%BA%8F/ Thu, 05 Dec 2019 09:59:35 +0800 https://www.mayuan.site/post/%E7%AE%97%E6%B3%95/%E6%8E%92%E5%BA%8F/ 排序算法 插入排序 1 2 3 4 5 6 7 8 def insertion_sort(array): for i in range(1,len(array)): key=array[i] j=i-1 while j>=0 and array[j]>key: array[j+1]=array[j] j-=1 array[j+1]=key 插入排序只要记得就想扑克牌一样就好了，没什么大的问题。这里用了比较经典的思路，