Definition of Searching :-
Searching is a process or method in which a particular data searching for according to question. That can be find in a complete data base searching for computer system. It is a use of find location of searching is right in computer system. The location find after data where the store or not. Searching method are designs to take advantage in the file. System for optimum use of searching data element. Searching is a perfect base computer system and find location element, word. Types of searching a two name of searching.
1). Leaner of Searching.
2). Binary of Searching.
Types of Searching
1). Leaner of Searching :-
In the leaner search each element of an array is access one by one is a particular is store in computer system. It is a data structure is a sequence wise store in computer system. That is a leaner searching does not unsuccessful if all element searching are the access is not found in computer system.
Searching Algorithm
Step 1). Set array, search value
Set Location = 1
Step 2). While ( value < = No)
if List = T
Found = True
Else
Location = Location + 1
Step 3). If value is false
Not found
Else value found
Else
2). Binary of Searching :-
Binary searching is a process which help find a particular data in a complete data base or array when the data base or list of array is shorted when the linear searching of operation are implement in the computer system when the data arrange in proper manner.
Binary Search Algorithm
Step 1). Set Beg = 1, End =n
set mid = value (Beg + End /2)
Step 2). If search value > mid value
then End = Mid- 1
Step 3). Else;
Beg = Mid + 1
Step 4). Mid = value (Beg + End / 2)
Mid value = search value
End
No comments:
Post a Comment
If you have any doubts, Please lets me know and Please Follow our Website