Good evening, everyone.
I know this would be pretty easy for a lot of you, but I haven't been able to find any information, how to solve things common to this one.
- For each function f (n) (the complexity of the algorithms) and data n in the table below, determine the time t for which the algorithm will perform the calculations. We assume that the algorithms are processed on a computer capable of performing one million operations per second. You can use approximations in your answers.
I would be really greateful if anybody will explain how to solve it.
|n lg n|
I tried, but I'm just not sure what to do. Thank you in advance for any assistance.