Multiple Choice
The ________ is adequate for searching through small arrays.
A) binary search
B) linear search
C) unary search
D) bubble sort
E) None of these
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q3: In the average case, an item is
Q4: The number of comparisons made by a
Q5: A(n)_ search is more efficient than a
Q8: When an array is sorted from highest
Q8: The advantage of a linear search is
Q9: Array elements must be _ before a
Q10: The bubble sort is an easy way
Q12: A(n) _ search uses a loop to
Q20: A linear search can only be implemented
Q21: A binary search begins with the _