排序算法之快速排序代码c++

#include<iostream>
using namespace std; 
Paritition(int A[], int low, int high) {
    int pivot = A[low];
    while (low < high) {
         while (low < high && A[high] >= pivot) {
               --high;
         }
         A[low] = A[high];
         while (low < high && A[low] <= pivot) {
               ++low;
         }
         A[high] = A[low];
       }
       A[low] = pivot;
       return low;
}

 void QuickSort(int A[], int low, int high) //快排母函数
 {
   if (low < high) {
     int pivot = Paritition(A, low, high);
     QuickSort(A, low, pivot - 1);
     QuickSort(A, pivot + 1, high);
   }
 }
 
int main()
{
    int a[10] = {2,5,9,6,4,3,5,10,7,6};
    QuickSort(a,0,9); 
    for(int i = 0;i<10;i++)
    {
        cout << a[i] <<" ";
     } 
}