快速排序1(C++实现)

#include <iostream>

using namespace std;

const int N = 100;
void display(int a[],int n)
{
for(int i=1; i<=n; i++)
cout<<a[i]<<"  ";
}
int partition(int a[], int low, int high)  //具体排序过程
{
a[0] = a[low];
int key = a[low];
while(low<high)
{
while(low<high && a[high]>=key)
high--;
a[low] = a[high];
while(low<high && a[low]<=key)
low++;
a[high] = a[low]; 
}
a[low] = a[0];
return low;
}
void quickSort(int *a, int low, int high,int n)   //递归形式的快速排序
{
int pivotloc;
if(low<high)
{
pivotloc = partition(a,low,high);
display(a,n);
cout<<endl;
       quickSort(a,pivotloc+1,high, n);
       quickSort(a,low,pivotloc-1, n);
}
}


int main()
{
int a[N];
int n;
cout<<"请输入数据的个数n:";
cin>>n;
cout<<"请输入数据:";
for(int i = 1; i<= n; i++)
{
cin>>a[i];
}
quickSort(a,1, n, n);
display(a,n);
system("pause");
return 0;
}