Discussion:
Comparison of running times:
Q: For each function f(n) and time t in the following 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. show all work in detail.
|
|
1 second
|
1 minute
|
|
lg n
|
|
|
|
n lg n
|
|
|
|
n
|
|
|