C语言快速排序

void quick_sort(int *pdata, int len)
{
	int key;
	int low;
	int high;
	if(1 >= len)
	{
		return (void)0;
	}
	low = 0;
	high = len - 1;
	key = pdata[low];
	while(low < high)
	{
		while((low < high) && (pdata[high] >= key))
		{
			high--;
		}
		pdata[low] = pdata[high];
		while((low < high) && (pdata[low] <= key))
		{
			low++;
		}
		pdata[high] = pdata[low];
	}
	pdata[low] = key;
	quick_sort(pdata, low);
	quick_sort(pdata+low+1, len-low-1);
}