> For the complete documentation index, see [llms.txt](https://aisuko.gitbook.io/wiki/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://aisuko.gitbook.io/wiki/freesoftware/algorithm/linear_search_technique.md).

# Linear Search Technique

This technique for finding an element by checking through all elements one by one is known as the linear search algorithm. In the worst case, a linear search ends up checking the entire Array. Therefore, the time complexity for a linear search is O(N).

The edge case for a linear search is when the element is not present in the Array.

## Questions

[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/) [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/)