Data Structures and Algorithms Unit Test 7 of 227 of 22 Items Question Why is it preferable to use a linear search when searching smaller datasets?(1 point) Responses 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 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 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 more efficient with its memory allocation when searching smaller datasets. A linear search is more efficient with its memory allocation when searching smaller datasets. Skip to navigation page 1 of 1

Answer 1

The most appropriate response to the question "Why is it preferable to use a linear search when searching smaller datasets?" would be:

A linear search is easy to implement and faster than other algorithms when searching smaller datasets.

Linear search has a simplicity that makes it easy to code, and for small datasets, the overhead of implementing more complex search algorithms (like binary search) may not provide a significant performance benefit, thus making linear search a practical choice.