c++

 1 void QuickSort(int A[],int n,int left,int right)
 2 {
 3        int i,j,t;
 4       if(left<right)
 5       {
 6       i=left,j=right+1;
 7       while(1){
 8              while(i+1<n&&A[++i]<A[left]);
 9              while(j-1>-1&&A[--j]>A[right]);
10              if(i>=j)break;
11              t=A[i],A[i]=A[j],A[j]=t;   
12         }
13       t=A[left],A[left]=A[j],A[j]=t;
14         QuickSort(A,n,left,t-1);
15         QuickSort(A,n,t+1,right);
16       }    
17 
18 
19 }