Multiple Choice
The binary search algorithm
A) cannot be used to search an array that is not sorted
B) does twice as much work as sequential search on the average case
C) must be written using recursion
D) is slower than sequential search when the item being searched for is not in the array
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q10: A search for an item X in
Q11: If lower is the first subscript in
Q12: A contigous segment of an array is
Q13: Assuming a method<br>Int findMax(int array[ ],int last)that
Q14: Let F be an algorithm with complexity
Q16: Linear time is the class of all
Q17: The compareTo method of the Comparable interface<br>A)
Q18: For a computational problem,the input size<br>A) is
Q19: The best method for searching an array
Q20: If an array is known to be