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

Proving Activity Selection Correctness

Walk through a complete proof that the earliest-finish-time greedy strategy is optimal.

This lesson is for subscribers

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