Course contentsShow
Computer Science
Lesson 888 of 2,87221. Greedy AlgorithmsPro lesson

Activity Selection Problem

Select maximum non-overlapping activities from a set by always choosing the activity that finishes earliest.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.