Linear Search
Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element or group of elements is found. Otherwise, the search continues till the end of the data set. This has a time complexity of O(N) where ‘N’ is the length of the array
Searching in Array
Searching is one of the most common operations performed in an array. Array searching can be defined as the operation of finding a particular element or a group of elements in the array.
There are several searching algorithms. The most commonly used among them are:
- Linear Search
- Binary Search
- Ternary Search