# Algorithm

Lg stands for log(base 2).

For each function f(n) and time t in the attached table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) microseconds.

© BrainMass Inc. brainmass.com October 9, 2019, 10:57 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/problem-algorithms-238789

#### Solution Summary

This provides an example of determining the largest size of a problem for an algorithm.

$2.19