快速排序代码

\

#include <bits/stdc++.h>
#define sf scanf
#define pf printf
using namespace std;
void Quick_Sort(int *arr, int begin, int end)
{
    if(begin > end)
        return;
    int tmp = arr[begin];
    int i = begin;
    int j = end;
    while(i != j)
	{
        while(arr[j] >= tmp && j > i)
            j--;
        while(arr[i] <= tmp && j > i)
            i++;
        if(j > i)
		{
            int t = arr[i];
            arr[i] = arr[j];
            arr[j] = t;
        }
    }
    arr[begin] = arr[i];
    arr[i] = tmp;
    Quick_Sort(arr, begin, i-1);
    Quick_Sort(arr, i+1, end);
}
int n, a[30005];
int main ()
{
	sf ("%d", &n);
	for (int i = 1; i <= n; i ++)
	{
		cin >> a[i];
	}
	int begin = 1;
	int end = n;
	Quick_Sort(a, begin, end);
	for (int i = 1; i <= n; i ++)
	{
		cout << a[i] << " ";
	}
}