快速排序

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

void Swap(int *lhs,int *rhs)
{
    int temp = *lhs;
    *lhs = *rhs;
    *rhs = temp;
}

int Partition(int* Array,int begin,int end)
{
    int ran = begin+ rand() % (end-begin+1);//生成一个从begin到end的随机数
    Swap(&Array[ran],&Array[end]);
    int key = Array[end];
    int i = begin-1;
    for(int j = begin;j != end;++j)
    {
        if(Array[j]<key)
        {
            ++i;
            Swap(&Array[i],&Array[j]);
        }
    }
    Swap(&Array[i+1],&Array[end]);
    return i+1;
}
void QuickSort(int *arrlist,int beg,int end)
{
    if(beg < end)
    {
        int index = Partition(arrlist,beg,end);
        QuickSort(arrlist,beg,index-1);
        QuickSort(arrlist,index+1,end);
    }
}
int _tmain(int argc, _TCHAR* argv[])
{ 
    int arr[]={1,2,3,10,6,7,8,5,11,4,9,14,0};
    int LENGTH = sizeof(arr)/sizeof(int);
    QuickSort(arr,0,LENGTH-1);
    //快速排序之后的结果
    for(int i = 0;i != LENGTH;++i)
        cout<<arr[i]<<" ";
    return 0 ;
}