快速排序

void swap(int *a, int *b)
{
	int *tmp;
	tmp = a;
	a = b;
	b = tmp;
}

void quickSort(int a[], int left, int right)
{
	int i = left, j = right, key = left;
	if(left >= right)
		return;
	while(i != j)
	{
		while(i<j && a[j] >= a[left])
			j--;
		while(i<j && a[i] <= a[left])
			i++;
		swap(a[i], a[j]);
	}
	swap(a[i], a[key]);
	quickSort(a, left, j-1);
	quickSort(a, j+1, right);
}

int main()
{

	int a[] = {6, 1, 2, 8, 9, 3, 4, 5, 7, 8};
	int len = sizeof(a)/sizeof(a[0]);
	quickSort(a, 0, len - 1);
	for(int i = 0; i < len; i++)
	{
		cout << a[i] << ", ";
	}
	cout << endl;
}