Jump to content

Sorting algorithms/Quicksort: Difference between revisions

Sorting algorithms/Quicksort (view source)

Revision as of 02:40, 12 December 2007

No change in size ,  16 years ago
→‎{{header|Python}}
Line 266:
if len(L) <= 1: return L
pivot = random.choice(L)
return qsort([ltle for ltle in L if ltle <= pivot]) + [pivot] + \
qsort([gegt for gegt in L if gegt > pivot])
 
=={{header|Seed7}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/34565"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information