Searching is a 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 number of techniques available for searching. Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored. It is an algorithm that accepts an argument ‘a’ and tries to find an element whose value is ‘a’. Based on the type of search operation, these algorithms are generally classified into two categories: Sequential search and interval search. Searching may be sequential or not. If the data in the dataset are random, then we need to use sequential searching. Otherwise we can use other different techniques to reduce the complexity. The presentation gives you better understanding on the topic.

Arjun Julian

126 resources

0

1

4

Like