1.

Question 1

Order the given functions by increasing growth rate.

f1(n)=n3f1(n)=n3

f2(n)=n0.3f2(n)=n0.3

f3(n)=nf3(n)=n

f4(n)=nf4(n)=n

f5(n)=n2nf5(n)=nn2

f6(n)=n2f6(n)=n2

As an answer, provide a string of length exactly six (with no spaces or quotes) containing the numbers of six functions (the first number indicates the function with the smallest growth rate, while the last number indicates the function with the largest growth rate). For example, for a similar, but simpler problem f1(n)=n2f1(n)=n2, f2(n)=nf2(n)=n, f3(n)=n3f3(n)=n3 the answer would be 213.

1 point

2.

Question 2

Order the given functions by increasing growth rate.

f1(n)=3nf1(n)=3n

f2(n)=nlog2nf2(n)=nlog2n

f3(n)=log4nf3(n)=log4n

f4(n)=nf4(n)=n

f5(n)=5log2nf5(n)=5log2n

f6(n)=n2f6(n)=n2

f7(n)=nf7(n)=n

f8(n)=22nf8(n)=22n

As an answer, provide a string of length exactly eight (with no spaces or quotes) containing the indices of eight functions (so, the first number indicates the function with the slowest growth rate, while the last number indicates the function with the highest growth rate). For example, for a similar, but simpler problem f1(n)=2nf1(n)=2n, f2(n)=log2nf2(n)=log2n, f3(n)=n2f3(n)=n2 the answer would be 231.