快速排序的一个算法（一个例子）

#include<iostream>
using namespace std;
int a[1000001]={0};
int n,m;

int Partition(int a[],int low,int high)
{
int pre=a[low];
while(low<high)
{
while(low<high&&a[high]>=pre)
high--;
int temp;
temp=a[low];
a[low]=a[high];
a[high]=temp;
while(low<high&&a[low]<=pre)
low++;
temp=a[low];
a[low]=a[high];
a[high]=temp;
}
return low;
}

void QSort(int a[],int low,int high)
{

if(low<high)
{