Data Structures Quick Sort C Program

Data Structures Lab Manual / Data Structures Quick Sort C Program

Program Name: Write a C Program for Quick Sort in Data Structures

Theory

Quick / Partition Exchange Sort developed by a British computer scientist Tony 
Hoare  and splits of an array (partition) into smaller ones and swapping 
(exchange) based on the comparison with 'pivot' element selected.

Program Code

#include<stdio.h>
void quicksort(int a[25],int first,int last)
{
int i, j, pivot, temp;

if(first<last)
{
pivot=first;
i=first;
j=last;

while(i<j)
{
while(a[i]<=a[pivot]&&i<last)
i++;

while(a[j]>a[pivot])
j--;

if(i<j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}

}

temp=a[pivot];
a[pivot]=a[j];
a[j]=temp;
quicksort(a,first,j-1);
quicksort(a,j+1,last);
}
}

void main()
{
int i, n, a[25];

printf("Enter a of Elements: "); 
scanf("%d",&n);

printf("Enter Array Elements: ");  
for(i=0;i<n;i++)
scanf("%d",&a[i]);

quicksort(a,0,n-1);
printf("Sorted Elements Order: ");
for(i=0;i<n;i++)
printf(" %d\t",a[i]);
}

Input:
Enter a of Elements: 5
Enter Array Elements: 5 7 2 9 1

Output:
Sorted Elements Order:  1	 2	 5	 7	 9

Home Back