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

question 32

Multiple Choice

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

---

Definitions:

Average Variable Cost

The total variable cost divided by the quantity of output, representing the variable cost per unit of output.

Marginal Product

The additional output resulting from using one more unit of a particular input, holding all other inputs constant.

Marginal Cost

The incremental cost associated with producing an extra unit of a product or service.

Average Total Cost

The total cost of production divided by the number of units produced, representing the cost per unit of output.