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

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

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

A pivot element to partition unsorted list is used in a. Bubble Sort b. Merge Sort c. Quick Sort d. Selection Sort e. Binary Search

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

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