C语言快速排序

#include<stdio.h>
void quicksort(int a[], int L, int R)
{
	if (L >= R)
	{
		return;
	}
	int left = L, Right = R;
	int dd=a[left];
	while (left < Right)
	{
		while (left<Right && a[Right]>=dd)
		{
			Right--;
		}
		if (left < Right)
		{
			a[left] = a[Right];
		}
		while (left < Right && a[left] <= dd)
		{
			left++;
		}
		if (left < Right)
		{
			a[Right] = a[left];
		}
		if (left >= Right)
		{
			a[left] = dd;
		}
	}
	quicksort(a, L, R - 1);
	quicksort(a, L + 1, R);
}
int main()
{
	int a[10] = { 12,33,25,65,35,23,74,85,69,3 };
	int sz = sizeof(a) / sizeof(int);
	quicksort(a, 0, sz-1);
	for (int i = 0; i < sz; i++)
	{
		printf("%d ", a[i]);
	}
	return 0;
}