Write an algorithm to Implement Linear search algorithm

• Linear search, also known as sequential search, is a simple searching algorithm that checks each element in a collection until it finds the target value or reaches the end.
• It traverses the elements one by one, making it suitable for unsorted or small-sized arrays. However, it has a time complexity of O(n) as the search time grows linearly with the size of the input.