// 快速排序.cpp : Defines the entry point for the console application.
//以最后一个为基准及以第一个为基准
#include "stdafx.h"
#include <iostream>
using namespace std;
int* partition(int *begin,int *end)//以最后一个参数为基准(pivot)
{
int last=*end,i=-1,j=0,len=end-begin+1;
for(;j<len-1;++j)
{
if(begin[j]<=last)
{
int temp=begin[++i];
begin[i]=begin[j];
begin[j]=temp;
}
}
begin[len-1]=begin[++i];
begin[i]=last;
return begin+i;
}
int* partition2(int *begin,int *end)
{
int first=*begin;
int *left=begin;
int* right=end;
while(left<right)
{
while (first<*right)
right--;
while(left<right&&*left<=first)
left++;
if(left<right)
{
int temp=*left;
*left=*right;
*right=temp;
}
}
int *pos=right;
*begin=*right;
*right=first;
return pos;
}
void qsort(int *begin,int *end) //Range:[begin,end]
{
if(begin<end)
{
int *middle=partition2(begin,end);
qsort(begin,middle-1);
qsort(middle+1,end);
}
}
int main()
{
int arr[]=
{
1,5,9,2,4,5,1,2,3,11,99,88,77,78
};
qsort(arr,arr+( sizeof(arr)/sizeof(int) )-1);
for(int i=0;i<sizeof(arr)/sizeof(int);++i)
{
cout<<arr[i]<<" ";
}
cout<<endl;
return 0;
}