GUWAHATI 💋 Call Girl 9827461493 Call Girls in Escort service book now
Sorting programs
1. //...........HEAPSORT............................
#include<stdio.h>
#include<conio.h>
#define MAXSIZE 5
#define MAX 15
void main()
{
int a[MAX],n,i,s,f,item,value;
clrscr();
printf("Enter the number of elementsn");
scanf("%d",&n);
printf("Enter %d elements one by onen",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<n;i++)
{
item=a[i];
s=i;
f=(s-1)/2;
while(s>0 && a[f]<item)
{
a[s]=a[f];
s=f;
f=(s-1)/2;
}
a[s]=item;
}
for(i=n-1;i>0;i--)
{
value=a[i];
a[i]=a[0];
f=0;
if(i==1)
s=-1;
else
s=1;
if(i>2 && a[2]>a[1])
s=2;
while(s>=0 && value<a[s])
{
a[f]=a[s];
f=s;
2. s=2*f+1;
if(s+1<=i-1 &&(a[s]<a[s+1]))
s=s+1;
if(s>i-1)
s=-1;
}
a[f]=value;
}
printf("nThe sorted list is n");
for(i=0;i<n;i++)
{
printf("%dn",a[i]);
}
getch();
}
output:->
Enter the number of elements
5
Enter 5 elements one by one
20
10
40
50
61
The sorted list is
10
20
40
50
61
6. // INSERTION SORT....................
#include<stdio.h>
#include<conio.h>
void main()
{
int a[100],n,k,i,j,temp;
printf("How many elements : ");
scanf("%d",&n);
printf("Enter the elements of array : n");
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(k=1;k<n;k++)
{
temp=a[k];
j=k-1;
while((temp<a[i])&&(j>=0))
{
a[j+1]=a[j];
j=j-1;
}
a[j+1]=temp;
}
printf("Enter element after sorting:n");
for(i=0;i<n;i++)
{
printf("%dn",a[i]);
}
}
output:->
How many elements : 5
Enter the elements of array :
2
4
3
5
1
Enter element after sorting:
1
2
3
4
5
7. // BUBBLE SORT..........
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int main()
{
int *x,n,i,j,key,found,temp;
clrscr();
printf("nt Enter no. of elements: ");
scanf("%d",&n);
printf("tAllocating Memory");
x=(int *)malloc(n*sizeof(int));
printf("tReading of data n");
for(i=1;i<=n;++i)
scanf("%d",x+i);
for(i=1;i<=n;++i)
{
for(j=1;j<=n-i;++j)
{
if(*(x+j)>*(x+j+1))
{
temp=*(x+j);
*(x+j)=*(x+j+1);
*(x+j+1)=temp;
}
}
}
printf("*******Sorted Array*******n");
for(i=1;i<=n;++i)
{
printf("n%d",*(x+i));
}
getch();
}
OUTPUT:->
Enter no. of elements: 5
Allocating Memory Reading of data
12
45
67
34