2 docs tagged with "activity selection"

In this blog post, we'll explore the Activity Selection Problem, a classic greedy algorithm used to select the maximum number of activities that don't overlap.

A classic greedy algorithm problem to select the maximum number of mutually compatible activities.