Which of these is the best upper bound for
a growth rate of 5n + 3
?
O(n \log n)
O(n^2)
O(\log n)
O(1)
The simplifying rules tell us that we can drop constants and lower order terms from a polynomial that defines the growth rate.
If you don't see a tight upper bound, pick the smallest bound that is larger.