快速排序

#include<stdio.h>
int a[10005];
void QuickSort(int l, int r)
{
	int i = l, j = r;
	int mid = (l + r) / 2;
	while (i <= j)
	{
		while (a[i]<a[mid])
			i++;
		while (a[j] > a[mid])
			j--;
		if (i <= j)
		{
			int t = a[i];
			a[i] = a[j];
			a[j] = t;
			i++; j--;
		}
	}
	if (l < j)
		QuickSort(0, j);
	if (j < r)
		QuickSort(i, r);
}
int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &a[i]);
	}
	QuickSort(0, n-1);
	for (int i = 0; i < n; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	return 0;
}