排序算法_快速排序、随机快速排序

//------------------------快速排序--------------------------
int Partion(int a[],int low,int high)                                  //找出分割位置
{
    int key;
    key=a[low];
    while(low<high)
    {
        while(low<high&&a[high]>=key)high--;
        a[low]=a[high];
        while(low<high&&a[low]<=key)low++;
        a[high]=a[low];
    }
    a[low]=key;
    return low;
}
void QuickSort(int a[],int low,int high)
{
    int po;
    if(low<high)
    {
        po=Partion(a,low,high);
        QuickSort(a,low,po-1); //递归调用
        QuickSort(a,po+1,high);
    }
    else return ;
}

//-------------------------------------------------------------





//------------------------随机快速排序------------------------

void exchange(int &a,int &b)
{
    a=a+b;
    b=a-b;
    a=a-b;
}
int random(int p,int r)
{
   int a=rand()%r;
   if(a>=p)
  return a;
   else
  random(p,r);
}
//----------------------
template<typename T>
int randomized_partition(T a[],int p,int r)
{
int i =random(p,r); 
exchange(a[r],a[i]);
return Partion(a,p,r);
}
//-----------------------
template<typename T>
void randomized_quicksort(T a[],int p,int r)
{
if(p<r)
{
int q=randomized_partition(a,p,r);
randomized_quicksort(a,p,q-1);
randomized_quicksort(a,q+1,r);
}
}