Pain vs. Suffering

## Pain vs. Suffering

You’re here because you chose to invest in a different life. A better life.

Big O nation

This is used to describe the complexity of an algorithm as how much time and memory it holds O is referred to the most complicated case

O(1): fixed time/space in each time an algorithm is executed.

O(N): linearly growth with data size until it reaches O (worst case).

O(N²): directly proportional to square data size “common in nested iterations”.

O(2^N): double growth with addition of data ex: recursive Fibonacci.

O(log N): little effect on growth while doubling data size

Python is an easy, simple yet very effective programming language.

Assignment never copies data
Immutable types: floats, int, tuples, strings.
Attributes: objects, lists, values & keys and anything no the left of an assignment.
the best way to avoid a surprise of immutable laiasing is don’t mutate values, (write function that make new lists)¹
Names have no type & values have no scope.
Python isn’t called by value nor by reference, but by assignment.