Sorting algorithms/Quicksort: Difference between revisions

Content deleted Content added

Inline

@@ Line 559: / Line 559: @@
 In a Haskell fashion:
  def qsort(L):
-     if len(L) <= 1: return L
+    return (qsort([y for y in L[1:] if y <= L[0]]) +
-     pivot, L = L[0], L[1:]
+            L[:1] +
-     return qsort([y for y in L if y <= pivot]) + [y for y in L if y == pivot] + \
+            qsort([y for y in L[1:] if y >  L[0]])) if len(L) > 1 else L
-            qsort([y for y in L if y >  pivot])
 =={{header|Scheme}}==