In this blog we will see the basics of DSA, the topic is linear search. linear search is based on the brute force approach by comparing every element of an array with the given key.
The Time complexity of linear search – O(n)
Space Complexity of linear search – O(1)