Summary Exercise: CS$3$

Practicing Algorithm Analysis Summary Questions

Current score: $2$ out of $5$

You are given this set of growth functions: $n!,2^n,2n^2,5nlogn,20n,10n$

For the growth function $2^n,$ type a value $($a positive integer$)$ for which this function is the most efficient of the six. If there is no integer value for

which it is most efficent, type "none".

Note: Assume all logs are base $2.$

You are going to need to try things out on scratch paper to figure this out.

Try plugging a few small numbers into each of the six functions and see what you get. Then see what happens when you make a

number one bigger or smaller.