快速排序的python实现：递归与非递归

递归版本 def quick_sort(li, start, end): if start >= end: return left = start right = end mid = li[left] while left < right: while left < right and li[right] >= mid:

>>阅读原文<<