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 0 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

A) the algorithm F is asymptotically faster than G

Computer Science & Information Technology

You might also like to view...

Any device connected to a network is generically termed a(n) ____ or station.

A. array B. node C. server D. transmitter

View
Computer Science & Information Technology

Sequences never include ____.

A. terminations B. tasks C. decisions D. steps

View
Computer Science & Information Technology

Which two parts are commonly input devices? (Select two.)

A) Mouse B) Hard drive C) Display D) Motherboard E) Keyboard

View
Computer Science & Information Technology

What is the output of the following code? ? queueType queue; int x, y; ? x = 2; y = 6; queue.addQueue(x); queue.addQueue(y); x = queue.front(); queue.deleteQueue(); queue.addQueue(x + 2); queue.addQueue(x); queue.addQueue(y - 3); ? while (!queue.isEmptyQueue()) {    cout << queue.front() << " ";    queue.deleteQueue(); } cout << endl ?

A. 6 2 3 3 B. 6 2 4 2 C. 6 3 3 3 D. 6 4 2 3

View
Computer Science & Information Technology