IMPLEMENTATION OF QUICK SORT PROGRAM

IMPLEMENTATION OF QUICK SORT

PROGRAM:

#include
#include
#define size 10
void quick(int a[size],int,int);
int partition(int a[size],int,int);
void swap(int a[size],int *,int*);
int n;
void main()
{
int i;
int a[size];
clrscr();
printf("\n Quick Sort");
printf("\n Enter the no of sort");
scanf("%d",&n);
for(i=0;i{
printf("\nEnter the %d st number",i+1);
scanf("\n%d",&a[i]);
}
quick(a,0,n-1);
printf("\nSorted Array");
for(i=0;iprintf("%d",a[i]);
getch();
}
void quick(int a[size],int low,int high)
{
int m,i;
if(low{
m=partition(a,low,high);
quick(a,low,m-1);
quick(a,m+1,high);
}
}
int partition(int a[size],int low,int high)
{
int pivot=a[low],i=low,j=high;
while(i<=j)
{
while(a[i]<=pivot)
i++;
while(a[j]>pivot)
j--;
if(iswap(a,&i,&j);
}
swap(a,&low,&j);
return j;
}
void swap(int a[size],int *i,int*j)
{
int temp;
temp=a[*i];
a[*i]=a[*j];
a[*j]=temp;
}






























OUTPUT:

Quick Sort

Enter the no of sort 5

Enter the 1 st number 9

Enter the 2 st number 7

Enter the 3 st number 5

Enter the 4 st number 3

Enter the 5 st number 1

Sorted Array 1 3 5 7 9







CIET college Programs,LAB Programs for Engineering Students,DAA LAB Programs,DSA LAB Programs,Remoboys,karthik,Remokn,Student3k,programs source code,Design Analysis And Algorithms LAB Programs,Data Structures and Algorithms LAB Programs,LAB Codings,Coimbatore Institute of Engineering and Technology ( CIET )