&&&&&&&&&&&&&&&&&&&&&&&&&&&&主函數&&&&&&&&&&&&&&&&&&&&&&
#include
#include
#include
#include "WangQi.h"
using namespace std;
#define MAX 100
void main(){
SeqList L;
int num;
cout<<"請輸入要排序的元素個數："<cin>>num;
cout<<"請輸入要排序的元素："<for(int i=1;i<=num;i++)
cin>>L.r[i];
L.length=num;
//輸出排序前的順序表
L.output(&L,1,L.length,-1);
L.quicksort(&L,1,L.length);
L.output(&L,1,L.length,-2);
}
&&&&&&&&&&&&&&&&&&&含有類定義的頭文件&&&&&&&&&&&&&&&&&&&&&&&&&
#include
using namespacestd;
#define MAX 100
class SeqList{
public:
int r[MAX+1];
int length;

void output(SeqList *L,int low, int high,int pivotloc){
int i;

if(pivotloc==-1||pivotloc==-2){
if(pivotloc==-1)
cout<<"初始狀態：{"<< ;
else cout<<"排序結果：{"<< ;
for(i=low;i<=high;i++)
cout<r[i]<< ;
cout<<"}";
}else {
cout<<"劃分結果：{"<< ;
for(i=low;i cout<r[i]<< ;
cout<<"}"<r[pivotloc]<<"{";
for(i=pivotloc+1;i<=high;i++)
cout<r[i]<< ;
cout<<"}";
}
cout<<<}

int partition(SeqList *L,int low,int high){
int pivotkey;
int temp1=low,temp2=high;
L->r[0]=L->r[low];
pivotkey=L->r[low];
while (low while (lowr[high]>=pivotkey)
--high;
L->r[low]=L->r[high];
while(lowr[low]<=pivotkey)
++low;
L->r[high]=L->r[low];
}
L->r[low]=L->r[0];
output(L,temp1,temp2,low);
return low;
}

void quicksort(SeqList *L,int low,int high){
int pivotloc;
if(low pivotloc=partition(L,low,high);
if(low quicksort(L,low,pivotloc-1);
if(high>pivotloc+1)
quicksort(L,pivotloc+1,high);
}
};