The worst case in binary search occurs ____.
A. when the object to be searched is in the middle of the list
B. when the object to be searched is at the end of the list
C. when the object to be searched is at the beginning of the list
D. when the object to be searched is not in the list
Answer: D
You might also like to view...
Which of the following characteristics is not shared by IS-IS and OSPF?
a. Use the Dijkstra algorithm. b. Classless protocols. c. Use Hello packets. d. The backbone can be segmented.
Match the laser printer step with the description. Exposing _______ Cleaning _______ Charging _______ Transferring _______ Developing _______ Fusing _______ Processing _______ A. Toner is attracted to the drum. B. Prepare the drum for use by applying voltage to it. C. Melt the toner onto the paper. D. 1s and 0s from the drum are attracted to the paper. E. Wipe residual toner from the drum. F. Put
1s and 0s on the drum. G. Convert the data into a bitmapped image. Fill in the blank(s) with correct word