Rank the followingfunctions by increasing order of growth (i.e., the slowest-gro
ID: 3608292 • Letter: R
Question
Rank the followingfunctions by increasing order of growth (i.e.,the slowest-growing first, the fastest-growing last):
(log n)2, n, n!, n, nlogn, 2n, n3, logn, n(1.2), n2, loglogn, n2 + log n, log n
where all the logarithms are to the base 2. If two functions haveequal orders of growth
then list them grouped together, e.g., betweenbrackets. Rank the followingfunctions by increasing order of growth (i.e.,
the slowest-growing first, the fastest-growing last):
(log n)2, n, n!, n, nlogn, 2n, n3, logn, n(1.2), n2, loglogn, n2 + log n, log n
where all the logarithms are to the base 2. If two functions haveequal orders of growth
then list them grouped together, e.g., betweenbrackets.
Explanation / Answer
Functions in increasing order are: loglogn lognlogn
(logn)2 n n nlogn n 1.2 n 2 = n 2 +logn n 3 2n n! n 2 = n 2 +logn n 3 2n n!
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.