排序算法 之 快速排序

#include <iostream>
using namespace std;
int partion(int data[],int length,int start ,int end)

{
    if (data == nullptr || length <= 0 ||end >= length)
    {
        return 0;
    }
    int small = start -1 ;
    int index =(start + end) >> 1;
    swap(data[index],data[end]);
    for (int index = start ; index < end ; ++index)
    {
        if (data[index] < data[end])
        {
            small++;
            if (small != index)
            {
                swap(data[index],data[small]);
            }
        }
    }
    small++;
    swap(data[end],data[small]);
    return small;
}
int quickSort(int data[],int length,int start ,int end)
{
    if (data == nullptr || length <= 0 ||end >= length)
    {
        return 0 ;
    }
    if (start == end)
    {
        return 0 ;
    }
    int index = partion(data,length,start ,end);
    if (index > start)
    {
        quickSort(data,length,start ,--index);
    }
    if (index < end )
    {
        quickSort(data,length,++index ,end);
    }
}
int main()
{
    int data[] = {2,3,5,1,50,6,4,0,-3,656,21,64,59,-78,62,3};
    quickSort(data,sizeof(data)/sizeof(int),0,sizeof(data)/sizeof(int)-1);
    for (int i =0 ;i < sizeof(data)/sizeof(int) ;++i)
    {
        printf("%d ",data[i]);
    }
    return 0;
}

输出结果为：-78 -3 0 1 2 3 3 4 5 6 21 50 59 62 64 656