i can't solve my homwork(in computer algorithms)?

Question

here the question :
list the function below from lowest asymptotic order to highest asymptotic order.If any two (or more) are the same asymptotic order, indicate which.
a.start with these basic function:
n 2^n n lg n n^3
n^2 lg n n-n^3+7n^5 n^2+lg n

b. combine the following functions into your answer for part (a).assume 0 e^n root n 2^n-1 lg lg n
1n n (lg n)^2 n! n^1+e

Answer 1

Bigger powers are higher than smaller powers. Any power is higher than a logarithm. b^n eventually increases faster than n^c for any b>1 and any c.

Answer 2

that's a binary problem. purely positioned, at any given element in time, on the transistor point you have in trouble-free terms have been given 0's and a million's to paintings with, so multiplication is dealt with by way of a series of bit flips and shifts that mimic arithmetic operations, whether it is all gentle of hand. desktops can no longer actual count variety.