随机化快速排序

#include 
#include 
#include 
using namespace std;

int random(int a,int b)
{
    srand(NULL);
return rand()%(b-a)+a;
}


void exchange(int &a,int &b)
{
int temp;
    temp=a;
    a=b;
    b=temp;
}

int partition(int *a,int p,int r)
{
int x=a[r];
int i=p-1;
for (int j=p;j    {
if (a[j]<=x)
        {
            i=i+1;
            exchange(a[i],a[j]);
        }
    }
    exchange(a[i+1],a[r]);
return i+1;
}

int randomized_partition(int *a,int p,int r)
{
int i=random(p,r);
    exchange(a[r],a[i]);
return partition(a,p,r);
}

void randomized_quicksort(int *a,int p,int r)
{
int q;
if (p    {
        q=randomized_partition(a,p,r);
        randomized_quicksort(a,p,q-1);
        randomized_quicksort(a,q+1,r);
    }
}

int main()
{
int a[]={4,1,3,2,16,30,10,14,15,4,6,8,0};
int length=sizeof(a)/sizeof(int)-1;
    randomized_quicksort(a,0,length);

for (int i=0;i<=length;i++)
        cout<"";

    system("pause");
return 0;
}

转载于:https://www.cnblogs.com/tiandsp/archive/2012/02/18/2357641.html