Could one of ya'll wise programmers out there be able to tell me what this question is asking me? I couldn't figure it out and this is for my Data Structures course that I am taking:
'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 algortihm to solve the problem takes f(n) microseconds.'
------|1 second|-----|1 minute|-----|1 hour|-----|1 day|----
lg n
------|--------|------|--------|-----|------|-----|-----|----
sqrt(n)
------|--------|------|--------|-----|------|-----|-----|----
n
------|--------|------|--------|-----|------|-----|-----|----
n lg n
------|--------|------|--------|-----|------|-----|-----|----
n^2
------|--------|------|--------|-----|------|-----|-----|----
n^3
------|--------|------|--------|-----|------|-----|-----|----
2^n
------|--------|------|--------|-----|------|-----|-----|----
n!
------|--------|------|--------|-----|------|-----|-----|----
Again, I do not require the answer I just need to know what this question is asking me. Thanks a lot folks.