快速排序

#include "stdafx.h"
#include <iostream>
#include<stack>
#include<exception>
using namespace std;


void swap(int* a ,int *b)
{
    int temp = *a;
    *a=*b;
    *b=temp;
}
int Partition(int data[],int length,int start,int end)
{
    if(data==NULL||length<=0||start<0||end>=length)
        throw new std::exception("Invalid Parameters");
    int index = start;
    swap(&data[index],&data[end]);
    int small = start-1;//small用来记录比枢轴小的数的位置.
    for(index=start;index<end;++index)
    {
        if(data[index]<data[end])
        {
            ++small;//找到一个比枢轴小的数就+1,
            if(small!=index)
                swap(&data[index],&data[small]);
        }
    }
    ++small;
    swap(&data[small],&data[end]);
    return small;
}
void QuickSort(int data[],int length,int start,int end)
{
    if(start==end)
        return;
    int index = Partition(data,length,start,end);
    if(index>start)
    QuickSort(data,length,start,index-1);
    if(index<end)
    QuickSort(data,length,index+1,end);
}
const int num = 6;
int _tmain(int argc, _TCHAR* argv[])
{
    int data[num]={4,3,1,6,10,2};
    QuickSort(data,num,0,num-1);

    cout<<"最后结果:"<<endl;
    for(int i = 0;i!=num-1;++i)
    cout<<data[i]<<"->";
    cout<<data[num-1]<<endl;
    return 0;
}