#include <iostream>
using namespace std;
void swap(int &a, int &b)
{
int c = a;
a = b;
b = c;
}
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)
{
//int q =0;
if(p < r)
{
int q = Partition(A,p,r);
......
阅读全文