8642 快速排序.txt

#include<iostream>
#include<string.h>
using namespace std;

template<class T>
int Partion(T array[],int s,int m,int n)
{
    int key=array[s];
    int low=s,high=m;
    while(low<high)
    {
        while(low<high&&array[high]>key) high--;
        array[low]=array[high];
        while(low<high&&array[low]<key) low++;
        array[high]=array[low];
    }
    array[low]=key;
    return low;
}
template<class T>
int QSort(T array[],int low,int high,int n)
{
    int mid,i;
    if(low<high)
    {
     mid=Partion(array,low,high,n);

     QSort(array,low,mid-1,n);
     QSort(array,mid+1,high,n);
    }