Question: In the proof of optimality for the greedy algorithm in interval scheduling, we picked to be the maximum for which the greedy and optimal solutions
In the proof of optimality for the greedy algorithm in interval scheduling, we picked to be the maximum for which the greedy and optimal solutions were identical choices. Why was this important in the overall proof?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
