#include<stdio.h>
#include<conio.h>
void quicksort(int[],int,int);
void main()
{
int x[20],size,i;
clrscr();
printf(" : : : Quick Sort : : : ");
printf("\nEnter the number of Elements: ");
scanf("%d",&size);
printf("Enter %d elements: \n",size);
for(i=1;i<=size;i++)
{
printf("Enter Element [%d] : ",i);
scanf("%d",&x[i]);
}
printf("\nUnsorted elements: \n");
for(i=1;i<=size;i++)
printf(" %d ",x[i]);
quicksort(x,1,size);
printf("\nSorted elements: \n");
for(i=1;i<=size;i++)
printf(" %d ",x[i]);
getch();
}
void quicksort(int x[100],int first,int last)
{
int pivot,j,temp,i;
if(first<last){
pivot=first;
i=first;
j=last;
while(i<j)
{
while(x[i]<=x[pivot] && i<last)
i++;
while(x[j]>x[pivot])
j--;
if(i<j){
temp=x[i];
x[i]=x[j];
x[j]=temp;
}
}
temp=x[pivot];
x[pivot]=x[j];
x[j]=temp;
quicksort(x,first,j-1);
quicksort(x,j+1,last);
}
}
0 Comments