static void QuickSort(ref List<int> nums, int left, int right)
 {
  if (left < right)
  {
  int i = left;
  int j = right;
  int middle = nums[(left + right) / 2];
  while (true)
  {
   while (i < right && nums[i] < middle) { i++; };
   while (j > 0 && nums[j] > middle) { j--; };
   if (i == j) break;
   int temp = nums[i];
   nums[i] = nums[j];
   nums[j] = temp;
   if (nums[i] == nums[j]) j--;
  }
  QuickSort(ref nums, left, i);
  QuickSort(ref nums, i + 1, right);
  }
 }

def quicksort(array): 
 if len(array) < 2:  
  return array ------基線條件：為空或只包含一個元素的數(shù)組是“有序”的 
 else:  
  pivot = array[0] ------遞歸條件
  less = [i for i in array[1:] if i <= pivot] ------由所有小于基準值的元素組成的子數(shù)組  
  greater = [i for i in array[1:] if i > pivot] ------由所有大于基準值的元素組成的子數(shù)組  
 return quicksort(less) + [pivot] + quicksort(greater) 
print quicksort([10, 5, 2, 3])

public class Extend :List<int>
 {
  public static Extend operator +(Extend L1, Extend L2)
  {
   L1.AddRange(L2);
   return L1;
  }
 }

  static Extend QuickSort2(Extend nums)
  {
   if (nums.Count < 2)
   {
    return nums;
   }
   else
   {
    Extend minList = new Extend();//小于基準數(shù)的集合
    Extend maxList = new Extend();//大于基準數(shù)的集合
    int f = nums[0];
    for (int i = 1; i < nums.Count; i++)
    {
     if (nums[i] <= f) minList.Add(nums[i]);
     else maxList.Add(nums[i]);
    }
    return QuickSort2(minList) + new Extend() { f} + QuickSort2(maxList);//遞歸，并且使用+運算符
   }
  }

public class Extend :List<int>
 {
  private static Extend k = new Extend();
  
  public static Extend operator +(Extend L1, Extend L2)
  {
   if (L1.Count == 1) k.Add(L1[0]);
   if (L2.Count == 1) k.Add(L2[0]);
   return k;
   //L1.AddRange(L2);
   //return L1;
  }
 }