Sorting algorithms/Quicksort: Difference between revisions

m
m (→‎version 1: corrected a state's name. -- ~~~~)
Line 737:
List<int> resultSet = new List<int>();
resultSet.AddRange(quicksort(loe));
gt.Addif (pivot_vallt.Count == 0);{
loe.Add(pivot_val);
}else{
gt.Add(pivot_val);
}
resultSet.AddRange(quicksort(gt));
return resultSet;