算法设计-快速排序

#include<iostream>
using namespace std;

void quicksort(int r[],int low,int high) 
{
	if (low<high)
	{
		int l=low,h=high;
		int x=r[low];
		while(low<high)
		{
			while((low<high)&&(r[high]>=x)) high--;
			swap(r[low],r[high]);
			while((low<high)&&(r[low]<=x)) low++;
			swap(r[low],r[high]);
		}
		quicksort(r,l,high-1);
		quicksort(r,high+1,h);
	}
}

int main()
{
	int r[8],i;
	cout<<"请输入8个数字：";
	for(i=0;i<8;i++)
		cin>>r[i];
	quicksort(r,0,7);
	cout<<"排序完毕：";
	for(i=0;i<8;i++)
	    cout<<r[i]<<" ";
    cout<<endl;
    return 0;
}

仅作留档。