快速排序1 升序

#include <iostream>
using namespace std;

int PARTITION(int *A, int p, int r)
{
	int i = p - 1;
	int key = A[r];

	for (int j = p; j <= r - 1; ++j)
	{
		if (A[j] <= key)
		{
			++i;
			swap(A[i], A[j]);
		}
	}
	swap(A[r], A[i+1]);

	return i+1;
}

int QUICKSORT(int *A, int p, int r)
{
	if (p < r)
	{
		int q =	PARTITION(A, p, r);
		QUICKSORT(A, p, q-1);
		QUICKSORT(A, q+1, r);
	}

	return 0;
}

int main()
{
	int A[] = {9,8,7,6,5,4,3,2,1,0};

	QUICKSORT(A, 0, 9);

	for (auto &a : A)
	{
		cout << a;
	}

	return 0;
}