#include<stdio.h>
void swap(int *a, int *b)
{
int temp=*a;
*a=*b;
*b=temp;
}
int partition(int a[],int low,int high)
{
int i=low-1;
int j=low;
for(;j<high;j++)
{
if(a[j]>=a[high])
{
i++;
swap(&a[i],&a[j]);
}
}
swap(&a[i+1],&a[high]);
return i+1;
}
void quick_sort(int a[],int low,int high)
{
int q;
if(low<high)
{
q=partition(a,low,high);
quick_sort(a,low,q-1);
quick_sort(a,q+1,high);
}
}
int hoare_partition(int a[],int low,int high)
{
int x=a[low];
int i=low-1;
int j=high+1;
while(1)
{
do{j--;}
while(a[j]>x);
do{i++;}
while(a[i]<x);
if(i<j) swap(&a[i],&a[j]);
else return j;
}
}
void hoare_quicksort(int a[],int low,int high)
{
int q;
if(low<high)
{
q=hoare_partition(a,low,high);
hoare_quicksort(a,low,q);
hoare_quicksort(a,q+1,high);
}
}
int main()
{
int a[9]={45,32,1,5,34,2,4,32,2};
quick_sort(a,0,8);
int i=0;
for(;i<9;i++)
printf("%d ",a[i]);
printf("/n");
hoare_quicksort(a,0,8);
i=0;
for(;i<9;i++)
printf("%d ",a[i]);
printf("/n");
return 0;
}
void swap(int *a, int *b)
{
int temp=*a;
*a=*b;
*b=temp;
}
int partition(int a[],int low,int high)
{
int i=low-1;
int j=low;
for(;j<high;j++)
{
if(a[j]>=a[high])
{
i++;
swap(&a[i],&a[j]);
}
}
swap(&a[i+1],&a[high]);
return i+1;
}
void quick_sort(int a[],int low,int high)
{
int q;
if(low<high)
{
q=partition(a,low,high);
quick_sort(a,low,q-1);
quick_sort(a,q+1,high);
}
}
int hoare_partition(int a[],int low,int high)
{
int x=a[low];
int i=low-1;
int j=high+1;
while(1)
{
do{j--;}
while(a[j]>x);
do{i++;}
while(a[i]<x);
if(i<j) swap(&a[i],&a[j]);
else return j;
}
}
void hoare_quicksort(int a[],int low,int high)
{
int q;
if(low<high)
{
q=hoare_partition(a,low,high);
hoare_quicksort(a,low,q);
hoare_quicksort(a,q+1,high);
}
}
int main()
{
int a[9]={45,32,1,5,34,2,4,32,2};
quick_sort(a,0,8);
int i=0;
for(;i<9;i++)
printf("%d ",a[i]);
printf("/n");
hoare_quicksort(a,0,8);
i=0;
for(;i<9;i++)
printf("%d ",a[i]);
printf("/n");
return 0;
}