Let F be an algorithm with complexity function f(n), and let G be an algorithm with complexity function g(n). If the ratio f(n)/g(n) converges to infinity as n increases to infinity, then
A) the algorithm F is asymptotically faster than G
B) the algorithm G is asymptotically faster than F
C) the two algorithms are asymptotically equivalent in efficiency
D) None of the above
B) the algorithm G is asymptotically faster than F
Computer Science & Information Technology
You might also like to view...
When performing a cash flow analysis, the ________ is the sum of the positive and negative cash flows
A) loan payment amount B) percentage decrease flow C) net cash flow D) cumulative flow
Computer Science & Information Technology
Describe the types of facility you would expect to be provided in a multi-user DBMS.
What will be an ideal response?
Computer Science & Information Technology