摘要：并排 class mergeSort: def mergeSort(self, A): self.mSort(A, 0, len(A)-1) def mSort(self, A, lo, hi): if lo < hi: mid = (lo+hi)//2 self.mSort(A, lo, mid) 阅读全文