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.

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

A __________________ search looks through the search pool one element at a time. A. clever B. linear C. binary D. selection E. insertion

What is the main requirement for applying binary search?a.The array must have duplicate elements.b.The array must be sorted in ascending order.c.The array must have unique elements.d.The array must be sorted in descending order.

In which case is binary search not applicable?

Which of the following scenarios would make Binary Search inefficient?Searching in a large, sorted array.Searching in a small, unsorted array.Searching in a large, unsorted array.Searching in a large, sorted linked list.