Take the following list of functions and arrange them in asc

Take the following list of functions and arrange them in ascending order of growth rate. That is, if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) is O(g(n)). F_1(n) = n^2.5 f_2(n) = squareroot 2n f_3(n) = n + 10 f_4(n) = 10^n f_5(n) = 100^n f_6(n) = n^2 log n

Solution

Functions in ascending order of their growth rates:

100ⁿ > 10ⁿ > n^2.5 > n²logn > n+10 > sqrt(2n)

You can experiment by taking any value of \'n\' and calculating all functions.