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...
When a business uses the Internet to provide another business with the materials, services, or supplies it needs to conduct its operations, they are engaging in ________ e-commerce.
a. B2C b. C2B c. B2B d. C2C
Computer Science & Information Technology
What two virtual network switches in VMware Workstation 12 Pro provide communication with virtual machines without using the physical network?
A. VMnet0 and VMnet1 B. VMnet1 and VMnet8 C. VMnet2 and VMnet3 D. VMnet7 and VMnet8
Computer Science & Information Technology