修改您的
mergesort功能以忽略中间拆分。
def mergesort(lst): '''Recursively divides list in halves to be sorted''' if len(lst) == 1: return lst, 0 middle = len(lst)/2 left = mergesort(lst[:middle])[0] # Ignore intermediate splits right = mergesort(lst[middle:])[0] # Ignore intermediate splits sortedlist, splits = merge(left, right) return sortedlist, splits
