1. Engineering
  2. Computer Science
  3. can someone help me with this please thanks for each...

Question: can someone help me with this please thanks for each...

Question details

Can someone help me with this please? Thanks!

For each function f(n) and time t, determine the largest size n which should be an integer of a problem that can be solved in time t, assuming that the algorithm takes f(n) milliseconds to solve an instance of a problem of size n. Fill the value n in the corresponding entry. Assume that there are 30 days in a month.

1 Second 1 Minute 1 Hour 1 Day 1 Month
20log2n
n^2 + n
3^n
n!


Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution