What is linear search and how does it work?

What is linear search and how does it work?

Linear search is a simple algorithm that checks each element in a list sequentially until the desired element is found or the list ends.

Can you give me an example of how linear search is implemented?

Sure! In Python, a linear search can be implemented like this:

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 are the advantages and disadvantages of using linear search?

The main advantage of linear search is its simplicity and ease of implementation. However, it can be inefficient for large datasets since it has a time complexity of O(n).

When should I use linear search instead of other search algorithms?

You should use linear search when dealing with small or unsorted datasets where the overhead of more complex algorithms isn't justified.