Searching Techniques.
Definition: Searching Techniques are the techniques where we will find any element from top to bottom or from bottom to top. These searching techniques are basically classified into two categories they are :
1. Linear Searching
2. Binary Searching
1. Linear Searching:
a. It is a searching for the element from the first element to last element. Linear search algorithm will find the given element in a list of elements with O(n) complexity of time where he value of n is total number of elements in the list.
b. This search process will be started by the given comparing search element with the first element in the list given . If both the cases are matched then result will be element found and otherwise search element is compared with next element in the given list. Here, the search element is compared with element by element in the list given by the user
2. Binary searching:
a. It is searching for element in half of the elements. Binary search algorithm will find the given element in the list of elements with O(log n) complexity of time where n value is total number of elements in the list provided. The binary search algorithm is used or can be used only with sorted list of elements given . That means it is used only in some order provided .It will check the element if it matches then it will show Element Found at some Place.
b. And Otherwise, if that element also doesn't match with the search element, then the result is " Element not found in the list".
The Linear and binary search is also explained in the below video
Now let us see some examples where we will write some programs for these Searching Techniques.
****Program for Linear Searching****:
#include<stdio.h>
#include<conio.h>
int main()
{
int
a[]={1,3,8,18,13,15,11,25,14,27,23,30,19,8,50};
int i,flag,num;
printf("\n Enter the number u want to
search");
scanf("%d",&num);
flag=0;
for(i=0; i<15;i++)
{
if(num==a[i])
{
printf("\n your
number found at location a[%d]",i);
flag=1;
break;
}
}
if(flag==0)
{
printf("\n Your number not
found");
}
getch();
}
****Program for Binary Searching****:
#include<stdio.h>
#include<conio.h>
int main()
{
int
a[]={1,3,5,10,18,20,26,31,36,40,43,57,58,60,66,73,78,80};
int num,l=0,h=17,m;
printf("\nEnter the number you want to
search");
scanf("%d",&num);
while(1)
{
m=(l+h)/2;
if(num==a[m])
{
printf("\nFound
at a[%d]",m);
break;
}
if(num>a[m])
{
l=m+1;
}
else
{
h=m-1;
}
if(l>h)
{
printf("\n number is not found");
break;
}
}
getch();
}
Note :
In binary search, elements must be either in
ascending order or descending.
In linear search elements can be random
order.
0 Comments