快速排序的实现

#include<iostream>
using namespace std;
void quicksort(int left,int right,int arr[])
{
	if(left > right)
		return ;
	int i,j,t,tmp;
	i = left;
	j = right;
	t = arr[left];
	while(i != j)
	{
		while(arr[j] >= t && i < j)
			j --;
		while(arr[i] <= t && i < j)
			i ++;
		if(i < j)
		{
			tmp = arr[i];
			arr[i] = arr[j];
			arr[j] = tmp;
		}
	}
	arr[left] = arr[i];
	arr[i] = t;
	quicksort(left,i - 1,arr);
	quicksort(i + 1,right,arr);
	
}
int main()
{
	int a[] = {5,7,4,2,9,0,8,1,3,6};
	quicksort(0,9,a);
	for(int i = 0;i < 10;i ++)
 		cout<<a[i]<<" ";
	cout<<endl;
	return 0;	
}