Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.
Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.
Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.
Covers the introduction to logarithms, algorithmic notations, and analysis of algorithm travel times.
Explains the binary search algorithm using two pointers to efficiently search a sorted list.
