快速排序

#include<iostream>

void swap(int *a,int *b)

{

int tmp = *a;

*a = *b;

*b = tmp;

}

int Pratition(int *a,int l,int r)

{

int i,j;

i = r;

for(int j = r;j != l;j--)

{

int k = a[l];

if(a[j] > k)

{

swap(&a[j],&a[i]);

i--;

}

}

swap(&a[i],&a[l]);

return i;

}

void Quick_sort(int *a,int l,int r)

{

if(l < r)

{

int d = Pratition(a,l,r);

Quick_sort(a,l,d-1);

Quick_sort(a,d+1,r);

}

}

int main()

{

int a[10] = {5,6,4,7,3,8,2,9,1,0};

Quick_sort(a,0,9);

for(int i = 0;i != 10;i++)

std::cout << a[i] << " ";

std::cout << std::endl;

return 0;

}