The order will be
12 < log(n) < (n)^(1/3) < sqrt(n) < (n)^3 <
(2)^(log(n)) < (2)^(sqrt(n)) < (2)^(n) < (3)^(n)
i.e,
f3(n) < f7(n) < f2(n) < f5(n) < f9(n) < f4(n) <
f8(n) < f6(n) < f1(n)
Here
(1)initially 12 is constant so it will give O(1) constant time so
it is the least of all
(2)log(n) is the O(log n) which is logarithmic time
(3)(n)^(1/3) since it is third root it will be less that
sqrt(n)
(4) sqrt(n) it is O(sqrt(n))
(5)(n^3) it is O(n^3) which is cubic time
(6)(2)^(log(n)) it is exponential since it is logarithmic it is
smaller than remaining
(7)(2)^(sqrt(n)) it is exponential since the exponent has sqrt(n)
it is larger that logarithmic
(8)(2)^(n) it is exponential time
(9)(3)^(n) it is also exponential since the base is high it will be
high
If you have any doubts please comment and please don't dislike.
2^log(n) = n.
So that should be in front of n^3. Except for that the answer is correct.
Order of Growth Rate Order the following functions by asymptotic growth: (i) fi(n) 3" (ii) f2(n)...
Rank the following functions in order from smallest asymptotic running time to largest. Addi- tionally, identify all pairs x, y where fæ(n) = (fy(n)). Please note n! ~ V2an(m)". i. fa(n) = na? ii. f6(n) = 210! iii. fe(n) = log2 n iv. fa(n) = log² n v. fe(n) = {i=i&j=i+1 vi. ff(n) = 4log2 n vii. fg(n) = log(n!) viii. fn(n) = (1.5)” ix. fi(n) = 21
Introduction to Algorithms course
Arrange the following in increasing order of asymptotic growth rate. For full credit it is enough to just give the order. (a) fi(n) = n4/100 (b) f2(n) = n3/20 (c) f3(n) = 23vn (d) f4(n) = n(log n) 1000 (e) f5(n) = 2n log n (f) f6(n) = 2(log n)0.9
1. 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 (g(n)). fi(n) = 10”, fz(n) = n3, f3(n) =n", fa(n) = log2 n, f5(n) = 2V1082 n
Order the following functions by asymptotic growth rate. 2n log n + 2n, 210, 2 log n, 3n + 100 log n, 4n, 2n, n2 + 10n, n3, n log n2
Arrange the following functions 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) -O(gln) fl (n) = n/i f2 (n)- 3" fs (n)-nIg(n') JA (n)- ()+54 More specifically, match the functions f? through fe to the corresponding positions a through f to illustrate the correct asymptotic order: I Choose ] I Choose ] Choose ] Choose ] I Choose ] I Choose ]
Order the following functions by asymptotic growth rate: 4n, 2^log(n), 4nlog(n)+2n, 2^10, 3n+100log(n), 2^n, n^2+10n, n^3, nlog(n) You should state the asymptotic growth rate for each function in terms of Big-Oh and also explicitly order those functions that have the same asymptotic growth rate among themselves.
Order the following functions by asymptotic growth rate (from smallest (1) to largest (5)). 2logn 3∗n+100∗log(n) n^2 n∗log(n) 2^10
Arrange the following functions in ascending order of asymptotic 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)): 2 Squareroot log n, 2^n, n^4/3, n(log n)^3, n log n, 2 2^n, 2^n^2. Justify your answer.
3-3 Ordering by asymptotic growth rates a. Rank the following functions by order of growth; that is, find an arrangement 81,82, 830 of the functions satisfying gi = Ω(82), g2 Ω(83), , g29 = Ω(g30). Partition your list into equivalence classes such that functions f(n) and g(n) are in the same class if and only if f(n) = Θ(g(n)) Chaptr3 Growth of Functions 1n In Inn lg* g nn-2" n'ln Ig nIn n 2" nlgn 22+1 b. Give an example...
16. Order the following functions from lowest to highest 0-class. fs= 4n /n+2n2 - fonlg (n')-lg (n'3) f2- 3n -lg (lg (n)) + n°.5 fs=3n3- 2n2 +4n - 5 f, 31459 + 1.5n lg (n) f=1.2" - 0.8" +2n2
16. Order the following functions from lowest to highest 0-class. fs= 4n /n+2n2 - fonlg (n')-lg (n'3) f2- 3n -lg (lg (n)) + n°.5 fs=3n3- 2n2 +4n - 5 f, 31459 + 1.5n lg (n) f=1.2" - 0.8" +2n2