Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted

Inline

@@ Line 266: / Line 266: @@
      if len(L) <= 1: return L
      pivot = random.choice(L)
-     return qsort([le for le in L if le <= pivot]) + [pivot] + \
+     return qsort([lt for lt in L if lt < pivot]) + [pivot]*L.count(pivot) + \
-            qsort([gt for gt in L if gt >  pivot])
+            qsort([gt for gt in L if gt > pivot])
 =={{header|Seed7}}==