The correct response is: A linear search is easy to implement and faster than other algorithms when searching smaller datasets.
This is because, for small datasets, the simplicity of a linear search (which checks each element one by one) often leads to good performance without the overhead of more complex algorithms, which may be better suited for larger datasets.