Linear Search
Linear search, also known as sequential search, is a fundamental algorithm used to find a specific element within a list. It operates by starting at the beginning of the list and examining each element one by one until the target element is found or the end of the list is reached. This method is straightforward and does not require the list to be sorted, but it can be inefficient for large datasets.