快速排序

快速排序的基本思想：在顺序表中随机选取一位作为基准位，通过由两边像中间扫描，将不大于基准的元素放在左侧，不小于基准的元素放在右侧，将基准位作为中间节点，两侧分别递归进行快速排序，直到分组元素个数小于等于1；

一般我们都以第一位作为基准位，代码如下：

#include <iostream>
#include <cstdlib>
#include <ctime>
#define LENGTH 10
using namespace std;
void print(int *num)
{
    for(int i=0; i<LENGTH; ++i)cout<<num[i]<<' ';
    cout<<endl;
}
int position(int *num,int low,int high)
{
    int tmp=num[low];
    while(low<high)
    {
        while(tmp<=num[high]&&low<high)high--;
        num[low]=num[high];
        while(num[low]<=tmp&&low<high)low++;
        num[high]=num[low];
    }
    num[high]=tmp;
    return high;
}
void qsort(int *num,int low,int high)
{
    if(low>=high)return ;
    int mid=position(num,low,high);
    qsort(num,low,mid);
    qsort(num,mid+1,high);
}
int main()
{
    srand(time(NULL));
    int num[LENGTH];
    for(int i=0; i<LENGTH; ++i)num[i]=rand()%100+1;
    cout<<"before:";
    print(num);
    qsort(num,0,LENGTH-1);
    cout<<"after:";
    print(num);

    return 0;
}

当元素趋近于有序时会时排序时间复杂度增加，接近于冒泡排序，所以可以改进基准位为随即选取，代码如下：

#include <iostream>
#include <cstdlib>
#include <ctime>
#define LENGTH 100
using namespace std;
void print(int *num)
{
    for(int i=0; i<LENGTH; ++i)cout<<num[i]<<' ';
    cout<<endl;
}
int position(int *num,int low,int high)
{
    int pos=rand()%(high-low+1)+low;
    int tmp=num[pos];
    num[pos]=num[low];
    while(low<high)
    {
        while(tmp<=num[high]&&low<high)high--;
        num[low]=num[high];
        while(num[low]<=tmp&&low<high)low++;
        num[high]=num[low];
    }
    num[high]=tmp;
    return high;
}
void qsort(int *num,int low,int high)
{
    if(low>=high)return ;
    int mid=position(num,low,high);
    qsort(num,low,mid);
    qsort(num,mid+1,high);
}
int main()
{
    srand(time(NULL));
    int num[LENGTH];
    for(int i=0; i<LENGTH; ++i)num[i]=rand()%100+1;
    cout<<"before:";
    print(num);
    qsort(num,0,LENGTH-1);
    cout<<"after:";
    print(num);

    return 0;
}