19.3.2. Greedy Approach Overview

Try these first

1. 1.

   What is a greedy algorithm?

   Hint

   Think about how these choices lead to overall success.

2. 2.

   Give an example of a problem that can be solved using a greedy algorithm.

   Hint

   Consider scheduling classes or meetings.

3. 3.

   Which of the following algorithms is a greedy algorithm?

   • Dijkstra's
   • Bubble Sort
   • Merge Sort

   Hint

   Think about the algorithm that deals with paths.

4. 4.

   True or False: A greedy algorithm always provides the optimal solution.

   • True
   • False

   Hint

   Consider the conditions necessary for a greedy algorithm to succeed.

5. 5.

   You have four meetings that each have start and end times: (1, 10), (2, 3), (4, 5), (6, 7). Which meetings should you choose to maximize attendance?

   Hint

   Look for short meetings that finish early!

6. 6.

   If a greedy strategy always selects the shortest interval first, present a scenario where this leads to fewer total selections than another strategy.

   Hint

   Consider overlap and availability.