Let F be an algorithm with complexity function f(n), and let G be an algorithm with complexity function g(n). If there exists a positive constant K such that the ratio f(n)/g(n) is less or equal to K for all n greater or equal to 1, then
A) the two algorithms are asymptotically equivalent
B) the algorithm F is asymptotically no worse than G
C) the algorithm F is asymptotically no better than G
D) Nothing intelligent can be said about the relative performance of the two algorithms.
B) the algorithm F is asymptotically no worse than G
Computer Science & Information Technology
You might also like to view...
A security analyst is working on a project that requires the implementation of a stream cipher. Which of the following should the analyst use?
A. Hash function B. Elliptic curve C. Symmetric algorithm D. Public key cryptography
Computer Science & Information Technology
Used in conjunction with an XML parser that supports data validation, a DTD can be used to accomplish what?
What will be an ideal response?
Computer Science & Information Technology