Greedy & Intervals Checkpoint

1. For interval scheduling, the correct primary sort key is:

End time (earliest finish) Start time (earliest start) Interval length Random order

2. Which data structure efficiently supports optimal merge?

3. A common greedy proof technique is the:

Exchange argument Pigeonhole principle Master theorem Backtracking proof

4. Always picking the earliest start time is:

Not optimal for interval scheduling Always optimal Only optimal for equal lengths Only optimal for sorted inputs

5. Time complexity of interval scheduling after sorting?