#include<stdio.h>
int main()
{
void QuickSort(int A[],int low,int high); int i,j,k;
int a[8];
printf("Enter 8 numbers\n");
for(i=0;i<8;i++)
scanf("%d",&a[i]);
QuickSort(a,0,7);
for(j=0;j<8;j++)
printf("%d\t",a[j]);
return 0;
}
void QuickSort(int A[],int low,int high)
{
int pivotpos=Partition(A,low,high);
QuickSort(A,low,pivotpos-1);
QuickSort(A,pivotpos+1,high);
}int Partition(int A[],int low,int high){ int pivot=A[low];
while(low<high){
while(low<high&&A[high]>=pivot)
--high;
A[low]=A[high];
while(low<high&&A[low]<=pivot)
++low;
A[high]=A[low]; }
A[low]=pivot;
return low;}
int main()
{
void QuickSort(int A[],int low,int high); int i,j,k;
int a[8];
printf("Enter 8 numbers\n");
for(i=0;i<8;i++)
scanf("%d",&a[i]);
QuickSort(a,0,7);
for(j=0;j<8;j++)
printf("%d\t",a[j]);
return 0;
}
void QuickSort(int A[],int low,int high)
{
int pivotpos=Partition(A,low,high);
QuickSort(A,low,pivotpos-1);
QuickSort(A,pivotpos+1,high);
}int Partition(int A[],int low,int high){ int pivot=A[low];
while(low<high){
while(low<high&&A[high]>=pivot)
--high;
A[low]=A[high];
while(low<high&&A[low]<=pivot)
++low;
A[high]=A[low]; }
A[low]=pivot;
return low;}




