C 快排练习

#include <stdio.h>

int Quick_Sort(int *arr,int left,int right);
void QuickSort(int* arr,int left,int right);
void Swap(int *a,int *b);

int main()
{
	int a[4],*A,i,l=0,r=3;
	for(i=0;i<4;i++)
	scanf("%d",&a[i]);
	A=a;
	QuickSort(A,l,r);
	for(i=0;i<4;i++)
	printf("%d",a[i]);
	return 0;
 } 
 

int Quick_Sort(int *arr,int left,int right)
{
	int i,j;
	for(i=left,j=left;i<right;i++)
	{
		if(arr[i]<arr[right])
		{
			Swap((arr+i),(arr+j));
			j++;
		}
	}
	Swap((arr+right),(arr+j));
	return j;
}

void QuickSort(int* arr,int left,int right)
{
	int div,i;
	if(left<right)
	{div=Quick_Sort(arr,left,right);
	QuickSort(arr,left,div-1);
	QuickSort(arr,div+1,right);
	}
}

void Swap(int *a,int *b)
{
	int c;
	c=*a;
	*a=*b;
	*b=c;
}