Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted
Line 737: Line 737:
List<int> resultSet = new List<int>();
List<int> resultSet = new List<int>();
resultSet.AddRange(quicksort(loe));
resultSet.AddRange(quicksort(loe));
if (lt.Count == 0){
if (loe.Count == 0){
loe.Add(pivot_val);
loe.Add(pivot_val);
}else{
}else{