Question: please be as detail as possible = 3. (10 Points) Suppose that an algorithm takes 12 seconds for an input N = 220 elements with
please be as detail as possible
= 3. (10 Points) Suppose that an algorithm takes 12 seconds for an input N = 220 elements with some particular, unspecified speed in instructions per second. How long would the same algorithm take (assuming same algorithm, same hardware) if the input instead contained 228 elements if the algorithm's complexity function is (a) (N) and (b) (log N), where log is base 2? You may assume that the low-order terms of the complexity functions are insignificant. State your answers accurately in terms of minutes, seconds, and tenths of a second as appropriate. a. (N) b. (log N)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
