Activity Selection Problem | Algorithms Lecture 32 | The cs Underdog

This lecture expains about the greedy algorithm that is used to solve activity selection problem. It also goes through the time and space complexity analysis of this algorithm.