随便写了个快速排序程序

#include 
using namespace std;
int InsertSort(int num[],int low,int high)
{
	int piov = 0;
	num[piov] = num[low];
	while(low < high)
	{
		while(low < high && num[high] > num[piov])
		             high--;
		num[low] = num[high];
		while(low < high && num[low] < num[piov])
		             low++;
		num[high] = num[low];
	}
	num[low] = num[piov];
	return low;
}
void QSort(int n[],int l, int h)
{
	int piov ;
	if(l>thenum[i];
	}
	QSort(thenum, 1, 10);
	cout << "输出" << endl; 
	for(i = 1; i < 11; i++)	
	     cout << thenum[i]<< "   ";
    return 1;
}