排序算法总结之快速排序

#include<cstdio>  
#include<ctime>  
#include<cstdlib>  
  
inline void (int &a, int &b)  
{  
    if(a!=b)  
    {  
        a^=b;  
        b^=a;  
        a^=b;  
    }  
}  
  
int Partition(int *A,int front,int end)  
{  
    int key = A[end];  
    int i = front - 1;  
  
    for(int current = front;current < end;++current)  
    {  
        if(A[current]<=key)  
            Swap(A[++i],A[current]);  
    }  
    Swap(A[++i],A[end]);  
    return i;  
}  
  
void QuickSort (int *A,int front,int end)  
{  
    if(front < end)  
    {  
        int midPosition = Partition(A,front,end);  
        QuickSort(A,front,midPosition-1);  
        QuickSort(A,midPosition+1,end);  
    }  
}