Revision as of 04:28, 25 October 2009 view source 164.67.199.150 (talk) remove duplicate section ← Older edit		Revision as of 04:33, 25 October 2009 view source 164.67.199.150 (talk) →‎{{header\|Python}} Newer edit →
Line 1,083: <lang python> def qsort(L): return (qsort([y for y in L[1:] if y <= L[0]]) + L[:1] + qsort([y for y in L[1:] if y > = L[0]])) if len(L) > 1 else L </lang> Line 1,095: else: pivot = list[0] less = [x for x in list if x < pivot] more = [x for x in list[1:] if x >= pivot] return qsort(less) + [pivot] + qsort(more) </lang>

Sorting algorithms/Quicksort: Difference between revisions