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

question 14

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

---

Definitions:

Daily Profit

The financial gain or loss a business experiences on a daily basis, calculated as the difference between daily revenue and daily expenses.

Capacity

The maximum output that a company can produce under normal conditions.

Marginal Costs

The surge in all-encompassing cost following the production of an additional unit of a product or service.

Demand for Wine

The desire or need for wine that consumers are willing and able to purchase at various prices.