I have one more problem. Arrange the functions 2^100n, 2^n^2, 2^n!, 2^2^n, n^logn, nlogn loglogn, n^3/2, n(logn)^3/2, and n^4/3(logn)^2
in a list so that each function is big-O of the next function. [Hint: To determine the relative size of some of these functions, take logarithms.]
Some of it I get. One of my main problems is how to do a log of a log. Would you be able to run me through your thought process?