/// <summary>
 /// 排序
 /// </summary>
 /// <param name="array">要排序的數(shù)組</param>
 /// <param name="low">下標(biāo)開始位置，向右查找</param>
 /// <param name="high">下標(biāo)開始位置，向左查找</param>
 public static void Sort(int[] array, int low, int high)
 {
  if (low >= high)
  return;
  //完成一次單元排序
  int index = SortUnit(array, low, high);
  //遞歸調(diào)用，對左邊部分的數(shù)組進(jìn)行單元排序
  Sort(array, low, index - 1);
  //遞歸調(diào)用，對右邊部分的數(shù)組進(jìn)行單元排序
  Sort(array, index + 1, high);
 }
 
 /// <summary>
 /// 單元排序
 /// </summary>
 /// <param name="array">要排序的數(shù)組</param>
 /// <param name="low">下標(biāo)開始位置，向右查找</param>
 /// <param name="high">下標(biāo)開始位置，向右查找</param>
 /// <returns>每次單元排序的停止下標(biāo)</returns>
 public static int SortUnit(int[] array, int low, int high)
 {
  int key = array[low];//基準(zhǔn)數(shù)
  while (low < high)
  {
  //從high往前找小于或等于key的值
  while (low < high && array[high] > key)
   high--;
  //比key小開等的放左邊
  array[low] = array[high];
  //從low往后找大于key的值
  while (low < high && array[low] <= key)
   low++;
  //比key大的放右邊
  array[high] = array[low];
  }
  //結(jié)束循環(huán)時(shí)，此時(shí)low等于high，左邊都小于或等于key，右邊都大于key。將key放在游標(biāo)當(dāng)前位置。 
  array[low] = key;
  return high;
 }