C#的快速排序算法

 The pseudocode of QuickSort is following:

     QUICKSORT(A, p, r )
          if p < r
          then q ←PARTITION(A, p, r )
                 QUICKSORT(A, p, q − 1)
                 QUICKSORT(A, q + 1, r )

=================================
          PARTITION(A, p, r )
               x ← A[r ]
               i ← p − 1
               for j ← p to r − 1
                    do if A[ j ] ≤ x
                         then i ← i + 1
                              exchange A[i ] ↔ A[ j ]
               exchange A[i + 1] ↔ A[r ]
               return i + 1

 

 1namespace QuickSort
 2{
 3    public class Class1
 4    {
 5        
 6        
 7        static void Main()
 8        {
 9            int[] arraySort = new int[]{12,25,41,5,7,85,45,16,89,54,11,23,46 };
            QuickSorter quickSort = new QuickSorter();
            int[] sorted=quickSort.QuickSort(arraySort,0,arraySort.Length-1);
            for (int i = 0; i < sorted.Length - 1;i++ )
            {
                Console.Write(sorted[i]+"  ");
            }
            Console.Read();
        }
    }

    public class QuickSorter
    {
        public int[] QuickSort(int[] array, int p, int r)
        {
            if (p < r)
            {
                int q = Partition(array, p, r);
                QuickSort(array, p, q - 1);
                QuickSort(array, q + 1, r);
            }
            return array;
        }

        public int Partition(int[] array, int p, int r)
        {
            int x = array[r];
            int i = p - 1;
            for (int j = p; j <= r - 1; j++)
            {
                if (array[j] <= x)
                {
                    i += 1;
                    int temp;
                    temp = array[i];
                    array[i] = array[j];
                    array[j] = temp;
                }

            }
            int temp2;
            temp2 = array[i + 1];
            array[i + 1] = array[r];
            array[r] = temp2;
            return i+1;
        }

    }
}