Program for Quick sort.

#include stdio.h
#include conio.h

void quick(int *,int,int);
int split(int *,int,int);
void main()
{
int a[100],n,i,p,q;
clrscr();
printf("Enter Size of Array: ");
scanf("%d",&n);
printf("Enter %d Elements: ",n);
for(i=0;i=p)
{
while(a[p] < pivot) { p++; if(p==high) { break; } } while(a[q] > pivot)
{
q--;
}
if(q>p)
{
t=a[p];
a[p]=a[q];
a[q]=t;
}
}
t=a[low];
a[low]=a[q];
a[q]=t;
return(q);
}