摘要：
def mergesort(L): print L if len(L)<2: return L[:] else: middle=len(L)/2 left=mergesort(L[:middle]) right=mergesort(L[middle:]) together=merge(left,right) print 'left' ,left print 'right',right print 'merge',together return toge... 阅读全文