Select complexities above to visualize how algorithms perform as the input size (n) grows. Tip: O(n^2) and O(2^n) grow very fast!