Question

1. n3 (log2n +5) +log2n 20 2. 532n2 10n log2n - 20n 25 3. nlog2n 20 10log2n + + 35n 4. 10n2 1000 2n 33n log2n

Once you have determined big-O bounds for each expression, order the expressions from the slowest growing (best algorithm, takes the least amount of time to execute) to the fastest growing.

Answer 1

Big O notation 1.O(n3 log2(n)) 2. O(n2) 3. O(nlog2(n)) 4. 0(2"

Time complexity from slowest growing to fastest growing algorithm.

3 (best algorithm) < 2 < 1 < 4 (worst algorithm)