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

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

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

In a binary search, _______________________________ . A. it is assumed that all of the elements are integers. B. it is assumed that the search pool is large. C. it is assumed that the search pool is ordered. D. it is assumed that all of the elements are Strings. E. it is assumed that the search pool is small.

As the number of items in a search pool grows, the number of comparisons required to search _______________ . A. increases B. stays the same C. decreases D. none of the above E. goes to 0

What is the maximum number of comparisons necessary when performing a binary search of100,000 items?a) 13b) 14c) 15d) 16# e) 17