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.

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