Please convert this c#code to pseudecode

static List quicksort(List list) { if (list.Count <= 1) return list; int pivotPosition = list.Count / 2; int pivotValue = list[pivotPosition]; list.RemoveAt(pivotPosition); List smaller = new List(); List greater = new List(); foreach (int item in list) { if (item < pivotValue) { smaller.Add(item); } else { greater.Add(item); } } List sorted = quicksort(smaller); sorted.Add(pivotValue); sorted.AddRange(quicksort(greater)); return sorted; }