Note: Please type your answer.

P1) List the following functions in ascending order based on their growth rate (start from the slowest function in the left-most). (20 points)

n log n, 1020000, 2n2, 2n2 + 5n, n!, n, 5n, log n, 2n

P2) You are given a function f(n) = 2n2 + 5n + 10 (30 points)

A. show is f(n) is (n2)

B.show is f(n) is not (n)

P2) You are given an array of integers <6,2,18,10,7,1,20,5, 12>. (50 points)

1. Apply the Quicksort algorithm to these numbers. You need to demonstrate at least four steps to get the full credit.