Module 1
Thinking about efficiency: Big O
Estimate how fast and how memory-hungry your code is before you run it.
- What a data structure is; linear vs non-linear structures
- Time and space complexity
- Big O, Omega and Theta notation
- The cost of common Python operations on lists, dictionaries and sets
- Measuring code with timeit
Practice: Compare two solutions to the same problem · Analyse ten short code snippets for complexity
