- #1
nuttynibbles
- 7
- 0
Hi,
I'm doing this algorithm questions and i need to find 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.
For example:
f(n) = log n
t = 1 seconds
how do i get the largest size of n in t time??
what i did is assume log is base 10, then:
lg x = y
x= 10^y
since:
f(n) = 1,000,000 microseconds
n = 10^1,000,000
am i right??
you can refer to the Q here: http://problems.datastructures.net/database/problems/compare-running-times/compare-running-times.pdf
I'm doing this algorithm questions and i need to find 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.
For example:
f(n) = log n
t = 1 seconds
how do i get the largest size of n in t time??
what i did is assume log is base 10, then:
lg x = y
x= 10^y
since:
f(n) = 1,000,000 microseconds
n = 10^1,000,000
am i right??
you can refer to the Q here: http://problems.datastructures.net/database/problems/compare-running-times/compare-running-times.pdf