快速排序

#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;
#define maxn 20
typedef struct SqList
{
int r[maxn];
int Length;
}SqList;

void InitSqList(SqList &L,int n)
{
int num;
for(int i=0; i<maxn; i++)
L.r[i] = 0;
for(int i=1; i<=n; i++)
{
cin>>num;
L.r[i] = num;
}
L.Length = n;
}

void PrintSqList(SqList L)
{
for(int i=1; i<=L.Length; i++)
cout<<L.r[i]<<" ";
}

//返回枢轴位置
int Partition(SqList &L,int low,int high)
{
int  temp;
temp = L.r[low];
L.r[0] = L.r[low];
while(low<high)
{
while(low<high&&L.r[high]>=temp) high--;
L.r[low] = L.r[high];
while(low<high&&L.r[low]<=temp) low++;
L.r[high] = L.r[low];
}
L.r[low] = L.r[0];
return low;
}

void QSort(SqList &L,int low,int high)
{
int add;
if(low<high)
{
add = Partition(L,low,high);
QSort(L,low,add-1);
QSort(L,add+1,high);
}
}

void QuickSort(SqList &L)
{
QSort(L,1,L.Length);
}

int main()
{
SqList L;
int n;
cin>>n;
InitSqList(L,n);
QuickSort(L);
PrintSqList(L);
return 0;
}