上面是归并,下面是快排,随机1000000个数字排序 代码 def merger(left, right): if not left: return right if not right: return left res=[] while left and right: if left[0] < right[0]: res.append(left.pop(0)) else: res.append(right.pop(0)) ...