C Sample File : Sorting and Searching
Sorting :
// Program To Sort An Array By
Using Bubble Sort
#include<stdio.h>
#include<conio.h>
void main()
{
int
a[50],i,j,ptr,n,temp;
clrscr();
printf("How Many Elemenets : ");
scanf("%d",&n);
printf("\nEnter %d Elements In Array :
",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("\nArray After Sort : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
getch();
}
Output :
How
Many Elemenets : 5
Enter
5 Elements In Array : 50 40 30 20 10
Array
After Sort : 10 20 30 40 50
// Program To Sort An Array By
Using Insertion Sort
#include<stdio.h>
#include<conio.h>
void main()
{
int
a[50],i,k,ptr,n,temp;
clrscr();
printf("How Many Elemenets : ");
scanf("%d",&n);
printf("\nEnter %d Elements In Array :
",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(k=1;k<n;k++)
{
temp=a[k];
ptr=k-1;
while(temp<a[ptr]&&ptr>=0)
{
a[ptr+1]=a[ptr];
ptr=ptr-1;
}
a[ptr+1]=temp;
}
printf("\nArray After Sort : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
getch();
}
Output :
How Many Elemenets : 5
Enter 5 Elements In
Array : 50 40 30 20 10
Array After Sort : 10 20 30 40 50
// Program To Sort An Array By
Using Selection Sort
#include<stdio.h>
#include<conio.h>
int min(int[],int,int);
void main()
{
int
a[50],i,k,n,temp,loc;
clrscr();
printf("How Many Elemenets : ");
scanf("%d",&n);
printf("\nEnter %d Elements In Array :
",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(k=0;k<n;k++)
{
loc=min(a,k,n-1);
temp=a[k];
a[k]=a[loc];
a[loc]=temp;
}
printf("\nArray After Sort : ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
getch();
}
int min(int a[50],int k,int s)
{
int
loc,j,t;
loc=k;
t=a[k];
for(j=k+1;j<=s;j++)
{
if(a[j]<t)
{
t=a[j];
loc=j;
}
}
return(loc);
}
Output :
How
Many Elemenets : 5
Enter
5 Elements In Array : 50 40 30 20 10
Array
After Sort : 10 20 30 40 50
Searching :
// Program To Serarch An Element
In Array Through Linear Search
#include<stdio.h>
#include<conio.h>
void main()
{
int
a[50],loc=0,i,n,item;
clrscr();
printf("How Many Elements You Want To
Insert :");
scanf("%d",&n);
printf("\nEnter Elements In Array :
");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\nEnter Number You Want To
Search :");
scanf("%d",&item);
for(i=0;i<n;i++)
{
if(item==a[i])
{
loc=i;
break;
}
}
if(loc==0)
{
printf("\nNumber Is Not Present
In Array !!!\n");
}
else
{
printf("\nNumber Is Present At %d
Location In Array !!!",loc);
}
getch();
}
Output
:
How
Many Elements You Want To Insert :5
Enter
Elements In Array : 10 20 30 40 50
Enter
Number You Want To Search :40
Number
Is Present At 3 Location In Array !!!
// Program To Serarch An Element In
Array Through Linear Search
#include<stdio.h>
#include<conio.h>
void main()
{
int
a[50],item,n,beg,end,mid,i,loc=0;
clrscr();
printf("How Many Elements You Want To
Insert :");
scanf("%d",&n);
printf("\nEnter Elements In Array :
");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\nEnter Number You Want To
Search :");
scanf("%d",&item);
beg=0;
end=n-1;
mid=(beg+end)/2;
while(beg<=end)
{
if(item==a[mid])
{
loc=mid;
break;
}
else if(item>a[mid])
{
beg=mid+1;
}
else if(item<a[mid])
{
end=mid-1;
}
mid=(beg+end)/2;
}
if(loc==0)
{
printf("\nNumber Is Not Present
In Array !!!\n");
}
else
{
printf("\nNumber Is Present At %d
Location In Array !!!\n",loc);
}
getch();
}
Output :
How Many Elements
You Want To Insert :5
Enter Elements In
Array : 10 20 30 40 50
Enter Number You
Want To Search :50
Comments
Post a Comment