Important concepts

Big O is a way to categorize your algorithms time or memory requirements based on input.

-    Growth is with respect to the input
-    Constants are dropped
-    Worst case is usually the way we measure