/*
快速排序的算法:
1.设两个指针low和high,初始事分别指向表的上下界,设枢轴纪录为的关键字为key,第一趟时 low = 1,high = L.lengh
2.从表的最右侧,依次向左搜索第一个关键字小于key的纪录和枢轴交换,
做法:当low 《 high ,L[high] > key,继续向左寻找--high
否则交换L[high] 和L[low]
3.然后在从表的最左侧的位置,依次向右搜索找到第一个关键字大于key的纪录和枢轴交换
做法:当low < high 时,若low所指的关键字小于key继续向右寻找
否则将L[low] = L[high]
4.重复步骤2 3 ,直到low与high相等为止,此时low或high的位置即为枢轴在此趟排序的最终位置,元彪为分为两个子表
5.执行 L[low] = key
*/
#include <iostream>
#define MAXSIZE 21
using namespace std;
int Partition(int Arry[],int low,int high)
{
Arry[0] = Arry[low];
while(low < high)
{
while(low < high && Arry[high] > Arry[0])--high;
Arry[low] = Arry[high];
while(low < high && Arry[low] < Arry[0])++low;
Arry[high] = Arry[low++];
}
Arry[low] = Arry[0];
return low;
}
void QuickSort(int Arry[],int low,int high)
{
if(low < high)
{
int mid = Partition(Arry,low,high);
QuickSort(Arry,low,mid - 1);
QuickSort(Arry,mid + 1,high);
}
}
int main()
{
int Arry[MAXSIZE] = {0,15,24,19,8,7,3,0,18,13,17,35,46,81,78,100,64,72,98,200,20};
QuickSort(Arry,1,20);
for(int i = 1; i < MAXSIZE; i++)
cout<<Arry[i]<<" ";
cout<<endl;
return 0;
}