Comparison of Running Times
For each function and time in the following table, determine the largest size of a problem that can be solved in time , assuming that the algorithm to solve the problem takes microseconds.
In microseconds, largest size of problem that can be solved is . To find the largest size of problem that can be solved in time , we need to solve the following equation for $$f(n) = t \text{ in microseconds}$$
Once we calculate the largest size of problem that can be solved in second (let’s say ), it is easy to do so for other time units. But remember, is an integer, so you should not just multiply with conversion factor- the answer will be off by huge amount for higher time complexities. Instead you should multiply in the beginning of the calculation.
Here are the calculations for largest size of problem that can be run in second…
^{[code]} | |
^{[code]} |