快速排序 c/c++

#include <bits/stdc++.h>
using namespace std;
void quick_sort(int *arr,int left,int right)
{
	if(left>right)
	return;
	
	int i = left; 
	int j = right;
	int at = *(arr+left);
	
	while(i!=j)
	{
		while(*(arr+j)>=at&&i<j)
			j--;
		
		while(*(arr+i)<at&&i<j)
			i++;
		
		int tp = *(arr+j);
		*(arr+j) = *(arr+i);
		*(arr+i) = tp;
		
	}
		int tp = *(arr+left);
		*(arr+left) = *(arr+i);
		*(arr+i) = tp;
	
	quick_sort(arr,left,i-1);
	quick_sort(arr,i+1,right);
}

int main()
{
	int arr[] = {6,1,2,7,9,3,10,5,4,8};
	
	quick_sort(arr,0,9);
	for(int i=0;i<10;i++)printf("%d ",arr[i]);
	return 0;
}