Big-oh notation for a time complexity can be misleading when:
A. it is not the best possible big-oh time complexity that applies correctly to the algorithm
B. the time complexity of the algorithm does not vary, and theta notation would work
C. the worst case time complexity of the algorithm is far worse than its best case and average case time complexities, and all of these are known in theta notation
D. All of the above
C
You might also like to view...
How can an organization document a project's lifecycle process to ensure that a project follows best practices?
Fill in the blank(s) with the appropriate word(s).
What term is sometimes used to describe a computer that runs a Windows operating system?
A. ePC B. xPC C. PC D. winPC
Cutting is the process of removing content and storing it to a temporary storage location, called a(n) ______.
Fill in the blank(s) with the appropriate word(s).
What is the primary method of authentication used in a typical PKI deployment?
A. Biometrics B. Digital certificates C. Smart cards D. Passwords