Lectures related to Dynamic Programming: Solving Sequential Problems Efficiently

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.