General Design and Development Question 10

A programmer is deciding between using a linear or binary search to find a target value in a sorted list. Which of the following is true?

In all cases, a binary search of a sorted list requires fewer comparisons than a linear search.

Generally, the advantage of using a binary search over a linear search increases as the size of the list increases.

A linear search will generally run faster than a binary search because a linear search requires fewer lines of code to implement.

Using a linear search is preferable to using a binary search if there is a chance that the target may not be found in the list.