快速排序算法

快速排序算法

#include<iostream>
using namespace std;
void swap(int *a ,int *b)
{
	int temp;
     temp=*a;
     *a=*b;
     *b=temp;	
}
int Partion(int data[],int low,int high)
{
	int pivotkey;
	pivotkey=data[low];
	while(low<high)
	{
	  while(high>low&&data[high]>=pivotkey)
	  high--;
	  swap(&data[low],&data[high]);
	  while(low<high && data[low]<=pivotkey)
	  low++;
	  swap(&data[low],&data[high]);		
	}
	
	return low;
} 
void QuickSort(int data[],int low,int high)
{
	if(low<high)
	{
		int m=Partion(data,low,high);
	    QuickSort(data,low,m-1);//分成两个部分 
	    QuickSort(data,m+1,high); // 
	}
	
}
int main()
{
	int data[10]={2,3,1,5,5,6,10,11,12,13};
	int num=sizeof(data) /sizeof(data[0]);
    QuickSort(data,0,9);
    int j=0;
	while(j<num)
	{
		cout<<data[j]<<endl;
		j++;
		
	}
	return 0;
	
}