C Program to Perform QuickSort

C Program to Perform QuickSort:

#include<stdio.h>
#include<conio.h>
void quicksort(int b[],int p,int q)
{
int j;
if(p<q)
{
j=partition(b,p,q+1);
quicksort(b,p,j-1);
quicksort(b,j+1,q);
}
}
int partition(int b[],int m,int p)
{
int v=b[m],i=m,j=p;
do
{
do
{
i++;
}while(b[i]<v);
do
{
j--;
}while(b[j]>v);
if(i<j)
{
p=b[i];
b[i]=b[j];
b[j]=p;
}}while(i<j);
b[m]=b[j];
b[j]=v;
return j;
}
main()
{
int i,a[50],n;
clrscr();
printf("Quicksort\nEnter the no. of elements to be sorted\n");
scanf("%d",&n);
printf("Enter elements one by one\n");
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
i=0;
quicksort(a,i,n);
printf("Sorted array is:\n");
for(i=1;i<=n;i++)
printf("%d\n",a[i]);
getch();
}