2.1 Greedy Algorithms Flashcards
1
Q
What is the interval scheduling problem
A
2
Q
What is the correct greedy algorithm to the interval scheduling problem (idea and psuedo-code)
A
- Greedy: Always pick the element with first finish time
3
Q
What are the properties of a greedy algorithm
A
4
Q
What are some incorrect greedy algorithms to the interval scheduling problem (ideas)
A
- Choosing the first starting interval
- Choosing the shortest intervals
