归并排序

python代码实现 def merg_sort1(alist): if len(alist)<=1: return alist num = len(alist)//2 left = merg_sort1(alist[:num]) right = merg_sort1(alist[num:]) return merge2(left,right) def merge2(left,right): l,

>>阅读原文<<