To write a C program to Quick Sort
#include
#include
int quick(int *p,int lb,int ub)
{
int pos=lb,t;
while(1)
{
while(p[ub]>=p[pos]&&pos!=ub)
ub--;
if(pos!=ub)
{
t=p[pos];
p[pos]=p[ub];
p[ub]=t;
pos=ub;
}
else
return pos;
while(p[lb]>p[pos]&&pos!=lb)
lb++;
if(pos=lb)
{
t=p[pos];
p[pos]=p[lb];
p[lb]=t;
pos=lb;
}
else
return pos;
}
}
void quicksort(int *p,int n)
{
int lower[10],upper[10],top=-1;
int l,u,pos;
lower[++top]=0;
upper[top]=n-1;
while(top!=-1)
{
l=lower[top];
u=upper[top--];
pos=quick(p,l,u);
if(pos+1{
lower[++top]=pos+1;
upper[top]=u;
}
if(pos-1>l)
{
lower[++top]=l;
upper[top]=pos-1;
}
}
}
void main()
{
clrscr();
int x[10],i;
printf("\n Enter Array");
for(i=0;i<10;i++)
scanf("%d",&x[i]);
quicksort(x,10);
printf("\n AFTER SOrting");
for(i=0;i<10;i++)
printf(" %d",x[i]);
getch();
}
|
| Author: Saurabh | Member Level: Gold | Revenue Score:  |
In which version did you run this project
|
| Author: pankaj agarwala | Member Level: Silver | Revenue Score: |
hi saurabh,
You can run this this project in any C compiler.
I have compiled it in Turbo C++.
|