How is Searching applicable in Computing field? Searching is the process of locating a particular element present in a given set of elements. The element may be a record, a table, or a file. There are numerous searching algorithms in a data structure such as linear search, binary search, interpolation search, jump search, exponential search, Fibonacci search, sub-list search, the ubiquitous binary search, unbounded binary search, recursive function. Searching is the process of finding a given value position in a list of values. It decides whether a search key is present in the data or not. It is the algorithmic process of finding a particular item in a collection of items. It can be done on internal data structure or the external data structure. A search algorithm is an algorithm that accepts an argument 'a' and tries to find an element whose value is 'a'. Search algorithms prevent one from having to look through lots of data to find the information you are searching for. There are many different types of searching algorithms. Two of them are serial search and binary search.

Payal Jain

185 resources

0

2

1

Like