A linear search always requires more comparisons than a binary search. A. True B. False

A linear search always requires more comparisons than a binary search. A. True B. False

A _______________ search is more efficient than a linear search. A. bubble B. insertion C. none of the above D. selection E. binary

If there are more items in a search pool, then it will typically require more comparisons to find an item. A. True B. False

In a sorted array, which search algorithm is more efficient than linear search?*1 pointA. Binary SearchB. Quick SearchC. Bubble SortD. Merge Sort

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool. A. True B. False