Assume that a program runs in f(n) microseconds, where f(n) is the function given on the...

    

Transcribed Image Text:

Assume that a program runs in f(n) microseconds, where f(n) is the function given on the left. Fill in how large an input n can be calculated, given each of the runtimes given along the top. I have filled in two values for you. You do not need to fill in every box, but should have at least of every row filled in, and at least half of the rows complete. 1 second lg n n 1012 1 1 1 1 1 minute hour day month year n n lgn n2 2n 1000 Show some calculations, or some of your code if you use code. Which row is the most sucktastic one? Why? Do you have any non-integer answers? Assume that a program runs in f(n) microseconds, where f(n) is the function given on the left. Fill in how large an input n can be calculated, given each of the runtimes given along the top. I have filled in two values for you. You do not need to fill in every box, but should have at least of every row filled in, and at least half of the rows complete. 1 second lg n n 1012 1 1 1 1 1 minute hour day month year n n lgn n2 2n 1000 Show some calculations, or some of your code if you use code. Which row is the most sucktastic one? Why? Do you have any non-integer answers?