The most common time complexities you'll see in Python:
O(1) (constant time): work doesn't grow (indexing)
O(N) (linear time): work grows with the data (looping)
O(n log n): a bit slower than linear (sorting)
O(n * n) (quadratic): work grows with square of the data (loop within a loop)