快速排序

#include<iostream>using namespace std;/*QuickSort*/

int Parttion(int a[],int low,int high);

void QuickSort(int a[],int low,int high);

void exchange(int &x,int &y);

int main(){  int array[]={0,5,8,9,12,1};  int low=0,high=6;  QuickSort(array,low,high);  for(int i=0;i<sizeof(array)/sizeof(int);i++)  cout<<array[i]<<"  ";  return 0;}

int Parttion(int a[],int low,int high) //选择最后一个元素为主元x=a[high]比较所有剩余的元素和该元素的值的大小，最后找到一个位置和a[high]交换{   int x=a[high];   int i=low-1;   for(int j=low; j<=high-1; j++)   {       if(a[j]<x)  {    i++;  exchange(a[i],a[j]);  }   }   exchange(a[high],a[i+1]);   return i+1;}void exchange(int &x,int &y){    int temp;    temp=x;    x=y;    y=temp;}void QuickSort(int a[],int low,int high) //递归实现 每个分段在划分过程中排序{  if(low<high)  {       int poviet=Parttion(a,low,high);     QuickSort(a,poviet+1,high);     QuickSort(a,low,poviet-1);  }}