快速排序應用代碼

def quick_sort(alist, start, end): 「」「快速排序」"" if start >= end: return mid = alist[start] left = start right = endweb # left與right未重合， 就向中間移動 while left < right: while left < right and alist[right]

>>阅读原文<<