擅长:python、mysql、java
<p>我认为在纯递归实现中不需要分区辅助函数:</p>
<pre><code>def quicksort_recursive(a):
if len(a) == 0:
return a
p = len(a) // 2
l = [i for i in a if i < a[p]]
m = [i for i in a if i == a[p]]
r = [i for i in a if i > a[p]]
return quicksort_recursive(l) + m + quicksort_recursive(r)
</code></pre>