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)). g1 (n) = 2√log n g2 (n) = 2n g4 (n) = n4/3 g3 (n) = n (log n) 3 g5 (n) = n logn g6 (n) = 2^ (2^n) g7 (n) = 2^ (n^2)

Question

Felix

Mathematics

7 February, 22:38

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)). g1 (n) = 2√log n g2 (n) = 2n g4 (n) = n4/3 g3 (n) = n (log n) 3 g5 (n) = n logn g6 (n) = 2^ (2^n) g7 (n) = 2^ (n^2)

+5

Answers (1)

Know the Answer?

Jair Sweeney · Answer 1

Step-by-step explanation:

From order of growth rate; Constant < Logarithmic < Polynomial < Exponential

Hence in ascending order; n (log n) ³ < n^4/3 < n^log n < 2√^ (logn) < 2n < 2n² < 2^2n