Quick Sort

#include<stdio.h>

#include<conio.h>

main()

{

char
ans;

do

{

int i,n,m,a[10];

clrscr();

printf("\n\n\t\t\tQUICKSORT");

printf("\n\t\t\t*********");

printf("\n\nENTER THE TOTAL ELEMENT:->");

scanf("%d",&n);

printf("\n\nENTER THE ELEMENT:->");

for(i=1;i<=n;i++)

scanf("%d",&a[i]);

qsort(a,1,n);

printf("\n\nSORTED ELEMENTS ARE :->");

for(i=1;i<=n;i++)

printf("\t%d",a[i]);

printf("\n\nDO U CONTINUE (Y/N) :->");

scanf("%s",&ans);

}

while(ans=='y' || ans =='y');

getch();

}

qsort(int a[10],int l,int r)

{

int
i,j,m,t;

i=l;j=r;

m=a[(l+r)/2];

while(a[i]<m)

i=i+1;

while(a[j]>m)

j=j-1;

if(i<=j)

{

t=a[i];a[i]=a[j];a[j]=t;i=i+1;j=j-1;

}

if(l<j)

qsort(a,l,j);

if(i<r)

qsort(a,i,r);

}