Which grows faster, 2^n or n! ?
10 pts (2 each)
Give the Big-O notation for the following expressions:
4n^5 + 3n^2 – 2;
5^n - n^2 + 19;
3n * log(n) + 11;
[n(n+1)/2 + n] / 2;
Questions 7-12 are 10 points each.
Assume numItems has the role of N, which may vary from one run to the next.
Let numItems = n in questions 7-12;
7. What is the Big-O running time for this code?
Explain your answer.