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
You might also like to view...
Video adapter cards are expansion devices that plug into a ____ on the motherboard.
A. plug B. circuit C. port D. bus
When setting up a mail merge document to prepare the envelopes for a set of merged letters, select ____ as the type of document.
A. Directory B. Envelopes C. Labels D. Letters
What software is typically used for larger systems?
a. Microsoft Server b. Canon c. Open Office d. Bitly
What programs are typically contained in office suites?
What will be an ideal response?