Why is it preferable to use a linear search when searching smaller datasets?(1 point) Responses A linear search is easy to implement and faster than other algorithms when searching smaller datasets. A linear search is easy to implement and faster than other algorithms when searching smaller datasets. A linear search is the best option for smaller datasets and larger datasets, too. A linear search is the best option for smaller datasets and larger datasets, too. A linear search requires fewer lines of code to search smaller datasets. A linear search requires fewer lines of code to search smaller datasets. A linear search is more efficient with its memory allocation when searching smaller datasets.
1 answer
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.
