数据结构版快速排序

//繁琐版快速排序

#include <iostream>
#define MAXSIZE 1000
using namespace std;

typedef struct
{
 int key;
 char *otherinfo;
}ElemType;
                    
typedef struct
{
 ElemType *r;
 int  length;
}SqList;


int Partition(SqList &L,int low,int high)//一趟划分 
{ 
  int pivotkey;
  L.r[0]=L.r[low]; 		//以pivotkey为基准 
  pivotkey=L.r[low].key;
  while(low<high)    //low==high是出口条件 
  {
    while(L.r[high].key>= pivotkey &&low<high) --high;   //L.r[high]只是下标，key才是具体的值 
    L.r[low]=L.r[high];    
    while(L.r[low].key<= pivotkey  &&low<high) ++low;     //注意 &&low<high ;注意>=和<=   
    L.r[high]=L.r[low];
  }
  L.r[low]=L.r[0];
  return  low;
}

void QSort(SqList &L,int low,int high)
{
  int pivotloc;
  if(low<high)
   {                                        
    pivotloc=Partition(L,low,high);                 	//划分结果赋给 pivotloc，此时基准是pivotloc 
    QSort(L,low,pivotloc-1);			// 注意 pivotloc-1 和 pivotloc+1 
	QSort(L,pivotloc+1,high);		//是对pivotloc的左半边和右半边进行处理 
   }
}

void QuickSort(SqList &L)
{
   QSort(L,1,L.length);
}
                                
void Create_Sq(SqList &L)
{
 int i,n;
 cin>>n;    //输入的值不大于 MAXSIZE
 for(i=1;i<=n;i++)
 {
  cin>>L.r[i].key;
  L.length++;
 }
}
void show(SqList L)
{
 int i;
 for(i=1;i<=L.length;i++)
  if(i==1) 
   cout<<L.r[i].key;
  else
   cout<<" "<<L.r[i].key;
}

int main()
{
 SqList L;
 L.r=new ElemType[MAXSIZE+1];
 L.length=0;
 Create_Sq(L);
 QuickSort(L);
 show(L);
 return 0;
}