DATA STRUCTURE AND ALGORITHM
Write a program to find the Seven elements using Quick Sort in c(Data Structure and Algorithm).
#include<stdio.h>
void quick_sort(int a[10],int low,int high);
void main()
{
int pivot,high,low,i,j,n,a[10];
printf("how many element you want to sort");
scanf("%d",&n);
printf("enter the element of an array");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
quick_sort(a,0,n-1);
low=0;
high=n-1;
quick_sort(a,low,high);
printf("after sorting the element are");
for(i=0;i<n;i++)
printf("%d\t",a[i]);
}
void quick_sort(int a[10],int low,int high)
{
int pivot,i,j,t;
if(low<high)
{
pivot=a[low];
i=low;
j=high;
while(i<j)
{
while(pivot>=a[i] && i<=high)
i++;
while(pivot<a[j] && j>=low)
j--;
if(i<j)
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
a[low]=a[j];
a[j]=pivot;
quick_sort(a,low,j-1);
quick_sort(a,j+1,high);
}
}
OUTPUT
amr@amr-virtual-machine:~$ gcc Quick.c
amr@amr-virtual-machine:~$ ./a.out
how many element you want to sort8
enter the element of an array9
7
4
5
1
6
8
4
after sorting the element are1 4 4 5 6 7 8
0 Comments:
Post a Comment