Anonymous user
Sorting algorithms/Quicksort: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 7,470:
<lang python>def qsort(L):
return (qsort([y for y in L[1:] if y < L[0]]) +
[L[
qsort([y for y in L[1:] if y >= L[0]])) if len(L) > 1 else L</lang>
| |||