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

Question

Quizplus · Accepted Answer

If f(n)/g(n) converges to infinity, it means f(n) grows much faster than g(n) as n increases, making G asymptotically faster than F.

Let F Be an Algorithm with Complexity Function F(n),and Let