作者：刘禹博         更新时间：2024-09-21 12:03          浏览：176次         点赞：0次          热度：20

def a(b): if len(b) <=1: return b mid=len(b)//2#分成两个小列表 left=a(b[:mid]) right=a(b[mid:]) return merge(left,right) #print(a([23,34,24,5,123,42,23])) def merge(left,right): result=[] i=0 j=0 while i<len(left) and j<len(right): if left[i] <= right[j]: result.append(left[i]) i+=1 else: result.append(right[j]) j+=1 result+=left[i:] result+=right[j:] return result c=[23,34,24,5,123,42] print(a(c))