Searching is the process of finding a particular element in a collection of elements. The collection of elements can be an array, a list, a tree, a graph, etc. The searching algorithm can be classified into two categories:
-
Sequential Search: In this, the list or array is traversed sequentially and every element is checked. For example: Linear Search.
-
Interval Search: These algorithms are specifically designed for searching in sorted data-structures. These type of searching algorithms are much more efficient than Linear Search as they repeatedly target the center of the search structure and divide the search space in half. For Example: Binary Search.
- Linear Search
- Binary Search
- Ternary Search
- Jump Search
- Interpolation Search
- Exponential Search