Anonymous user
Sorting algorithms/Quicksort: Difference between revisions
→{{header|Python}}
Line 266:
if len(L) <= 1: return L
pivot = random.choice(L)
return qsort([lt for lt in L if lt <
qsort([ge for ge in L if ge >
=={{header|Seed7}}==
| |||