Monday, 21 January 2013

Searching(Computer Science)


By on 02:50

Searching is a technique which is widely used in c,c++,java,c# and many other programming languages.We can search anything like files,folder,page,documents etc or in simple words we can search particular data item in a structured data base like dictionary.

Searching Technique is divide into 3 parts:-

1)Linear Search.
2)Binary Search.
3)Indexed Search.

1)Linear Search:-Linear Search are also called as sequential Search,in this technique we search the data items from structured data base in a linear way.
Linear way means one after another.This method considered as simple when we compared this to binary search.


#include<iostream.h>
#include<conio.h>
void main()
{
int a[30],i,j,k,x,n,flag;
cout<<"Enter Size"
cin>>n;
for(i=0;i<n;i++)
.
.
.
For More Click Here


2)Binary Search:-Binary Search is a searching technique which is used to locate items in ordered list of particular number.

3)Indexed Searching:-Index searching is technique which improve the efficiency of search items.In index searching the file is divided into blocks and keys.




If you have any query then leave your comments and don't forgot to follow me on Google+,Facebook,Twitter.

0 comments:

Post a Comment

Related Posts Plugin for WordPress, Blogger...