快速排序程序演示

#include<stdio.h>
void QuickSort(int*,int,int);
int Located(int*,int,int);
int main(void)
{
	int i;
	int a[6]={7,9,3,5,8,4};
	QuickSort(a,0,5);
	for(i=0;i<6;i++)
	{
		printf("%d ",a[i]);
	}
	return 0;
}
void QuickSort(int* a,int low,int high)
{
	int pos;
	if(low<high)
	{
		pos=Located(a,low,high);
		QuickSort(a,low,pos-1);
		QuickSort(a,pos+1,high); 
	}
}
int Located(int* a,int low,int high)
{
	int val=a[low];
	while(low<high)
	{
		while(low<high&&a[high]>=val)
		{
			high--;
		}
		a[low]=a[high];
		while(low<high&&a[low]<=val)
		{
			low++;
		}
		a[high]=a[low];
	}
	a[low]=val;
	return low; //or return high
}