快速排序1.0

 #include<iostream>
#include<algorithm>
#include <stdlib.h> 
#include <time.h> 
using namespace std;
void swap(int &v1, int &v2){
	int item;
	item = v2;
	v2 = v1;
	v1 = item;
}
int Partition(int *A,int p,int r)
{
	int x = A[r];
	int i = p - 1;
	for (int j = p; j <= r - 1; j++)
	{
		if (A[j] <= x)
		{
			i++; swap(A[i], A[j]);
		}	
	}
	swap(A[i+1],A[r]);
	return i + 1;
}
void 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);
	}
}
int main()
{
	//int A[9] = { 3, 7, 1, 9, 6, 4, 0, 2,8 };
	//int A[] = { 1, 4, 3, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 99, 88, 77, 100, 200, 300, 400, 550 };
	srand((unsigned)time(NULL));
	int A[1000];
	for (int i = 0; i != 1000; i++)
		A[i] = rand();
	QuickSort(A, 0, 999);
	for (int i = 0; i <=999; i++)
		cout << A[i] << " ";
 system("pause");		 
}