Linear search problem

Linear search, also known as sequential search, is a fundamental algorithm used to find a specific value or an element in a list or an array. The linear search problem involves searching through each element of the list one by one until the desired value is found or until all elements have been checked. ### Description of the Linear Search Algorithm: 1. **Initialization**: Start at the first element of the list.