Learning Agenda:
- Introduction to Time and Space Complexity
- What is Time Complexity and Space Complexity
- Big O Notation
- Big Omega Notation
- Big Theta Notation
- Time complexity of basic data structure operations (list, dictionary, etc.)
- Time and space complexity of common algorithms (sorting, searching, etc.)
- Analyzing time and space complexity of a given function
- Time and Space trade-off
- Asymptotic Analysis
- Best, worst, and average case analysis
- How to improve time complexity
- How to improve space complexity
- Some basic examples of how to use these concepts in practice.