Quick Sort

GXTechno Tags: c, data, structure, quick, sorting, sort

#include<stdio.h>
#include<conio.h>
#define max 100
int a[max],n,i,l,h;
void main()
{
void input(void);
input();
getch();
}

void input(void)
{
void output(int a[],int n);
void quick_sort(int a[],int l,int h);
printf("How many elements in the array : ");
scanf("%d",&n);
printf("\n");
printf("Enter the elemennts : \n");
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
l=0;
h=n-1;
quick_sort(a,l,h);
printf("Sorted Array :\n ");
output(a,n);
}

void quick_sort(int a[],int l, int h)
{
    int temp,key,low,high;
    low=l;
    high=h;
    key=a[(low+high)/2];
    do
    {
        while(key>a[low])
        {
            low++;
        }
        while(key<a[high])
        {
            high--;
        }
        if(low<=high)
        {
            temp=a[low];
            a[low++]=a[high];
            a[high--]=temp;
        }
    }  while(low<=high);
    if(l<high)
    quick_sort(a,l,high);
    if(low<h)
    quick_sort(a,low,h);
}
void output(int a[],int n)
{
for(i=0;i<=n-1;i++)
{
printf("%d\n",a[i]);
}
}

/*output of the program*/
How many elements
5
Enter the element of array
2
12
59
21
9
Element of array after sorting
2
9
12
21
59