Thread: function growth rate

I'm not sure about the best way to approach this problem. Are there specific steps to solve or know this, other than simply plugging numbers into the functions?

---------------------------------------

Order the following functions by growth rate:

a. 4*n*log(n) + sqrt(n)
b. 2^(log(n^2))
c. 3*n + 20 log n^2
d. n^3
e. n*log(n)
f. 2^200

Originally Posted by centenial

I'm not sure about the best way to approach this problem. Are there specific steps to solve or know this, other than simply plugging numbers into the functions?

You need to know the order of each simple function i.e




then use these with some arguments to order your set.

Originally Posted by centenial

f. 2^200

This does not grow at all.

Another helpful tip: the order of a function which is a sum of functions is the same as the order of the function with the highest order of the .