經典算法002--快速排序

 class Program
    {
        static void Main(string[] args)
        {
            int[] arrayInts = new int[] {99, 6, 7, 2, 14, 8, 2};
            Quick_by(ref arrayInts,0,arrayInts.Length);
        }

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