Growth Functions by speed(Big Oh Notation) (Computer Science)

Consider the following functions f(n) and answer the following questions. exponential: 2n quadratic polynomial: n2 logarithmic: log(n) cubic polynomial: n3 n log n: n log(n) factorial: n! linear: n

Question 1) Which of these functions grows the fastest? Question 2) Which of these functions grows the slowest? Question 3) Order these functions from #1 fastest growing to #7 slowest growing.

1. 2. 3. 4. 5. 6. 7.

Question 4) If these functions f(n) represent algorithm run times as a function of problem size n, which of the functions has the slowest run time?

Question 5) If these functions f(n) represent algorithm run times as a function of problem size n, which of the functions has the fastest theoretical run time?