Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted

Inline

@@ Line 737: / Line 737: @@
             List<int> resultSet = new List<int>();
             resultSet.AddRange(quicksort(loe));
-            gt.Add(pivot_val);
+            if (lt.Count == 0){
+                loe.Add(pivot_val);
+            }else{
+                gt.Add(pivot_val);
+            }
             resultSet.AddRange(quicksort(gt));
             return resultSet;