How do I implement a linear search algorithm?

How do I implement a linear search algorithm?

To implement a linear search, you iterate through each element in the list and check if it matches the target value.

Can you show me a code example?

Sure! Here's a simple Python example:

def linear_search(arr, target):
    for index, value in enumerate(arr):
        if value == target:
            return index
    return -1

This function returns the index of the target if found, otherwise -1.

What is the time complexity of linear search?

The time complexity of linear search is O(n), where n is the number of elements in the list.

Are there any alternatives to linear search?

Yes, alternatives include binary search (for sorted lists) and hash tables for faster lookups.