Suppose we have an algorithm that is described as having qua…
Suppose we have an algorithm that is described as having quadratic runtime performance. A) If that program were to take 10 units of time for an input of size n, how many units of time would we expect that program to take for an input of size 2n? B) If the algorithm were instead described as having logarithmic runtime performance, how many units of time would we expect for an input size of 2n assuming the same 10 units of time for an input of size n?C) If the algorithm were instead described as having exponential runtime performance, how many units of time would we expect for an input size of n+1 assuming the same 10 units of time for an input of size n?
Read Details