代码：

#include"iostream"using namespace std;int partition(int A[],int p,int r){    int i,j;    int x=A[r];    i=p-1;    for(j=p;j
     
      x){            i++;            int temp=A[i];            A[i]=A[j];            A[j]=temp;        }    }    int temp=A[i+1];    A[i+1]=A[r];    A[r]=temp;    return i+1;}void quickSort(int A[],int p,int r){    if(r>p){        int q=partition(A,p,r);        quickSort(A,p,q-1);        quickSort(A,q+1,r);    }}void main(){    int A[8]={
   12,34,1,3,12,11,24,8};    cout<
      
       <