Why should we describe the time complexity of the binary search algorithm as O( lg n )?
A. Its time complexity varies, but it is always worse than O( lg n ).
B. Its time complexity varies, but it is always better than O( lg n ).
C. Its time complexity varies, but it is never worse than O( lg n ).
D. Its time complexity varies, but it is never better than O( lg n ).
C
Computer Science & Information Technology
You might also like to view...
A data bus is made of wires on the motherboard
Indicate whether the statement is true or false
Computer Science & Information Technology
Which Cisco IOS command would enable a manual EtherChannel on a specific physical interface using group number 10?
A) channel-group 10 mode auto B) channel-group 10 mode manual C) channel-group 10 mode active D) channel-group 10 mode on
Computer Science & Information Technology