PHASE 09
๐ Correctness, Complexity & Quality
Prove your algorithms work and compare how much work they do. Preconditions, postconditions, invariants, testing, and time and space complexity โ taught intuitively before notation โ plus readability and maintainability.
โฑ๏ธ 2โ3 weeks
๐ 17 lessons
Hard
๐ฏ In this phase you willโฆ
- Reason about correctness with pre/postconditions and invariants
- Estimate how work grows when input doubles
- Read and use O(1), O(log n), O(n), O(n log n), O(nยฒ)
- Compare solutions on time and space
- Write readable, maintainable pseudocode
๐บ Lessons in this playlist
01
What Makes an Algorithm Correct?
02
Preconditions
03
Postconditions
04
Invariants
05
Testing
06
Edge Cases
07
Time Complexity
08
Space Complexity
09
Big O
10
O(1)
11
O(log n)
12
O(n)
13
O(n log n)
14
O(nยฒ)
15
Comparing Solutions
16
Readability
17
Maintainability
