Question: [ Asymptotics , 2 5 points ] Sort the following 2 0 functions from asymptotically smallest to asymptotically largest, indi - cating ties if there

[Asymptotics,25 points]
Sort the following 20 functions from asymptotically smallest to asymptotically largest, indi-
cating ties if there are any. You must provide proofs that justify your answers to receive full
credit! Nll logarithms are base 2 unless otherwise stated.
n4.5-(n-1)4.5,nlglgn,nn22,n2n,lg(lg*n)
nlglgnlgn,lg(9001)n,lg*2n,lg(n!),(lgn)lgn
i=2n222-1,e2n,nlglgn,n1337,lg*(n2)
(1+1787898)787898n,n!,,2lg*n,(lgn)lg*n
To simplify notation, write f(n)g(n) to mean f(n)=o(g(n)) and f(n)-=g(n) to mean
f(n)=(g(n)). For example, the functions n2,n,(n2),n3 could be sorted cither as nn2-=
(n2)n3 or as n(n2)-=n2n3.
[ Asymptotics , 2 5 points ] Sort the following 2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!