19.4. Algorithm Explanation

Try these first

1. 1.

   What defines a greedy algorithm?

   Hint

   Think about what the term 'greedy' refers to!

2. 2.

   Provide an example of a greedy algorithm.

   Hint

   Consider algorithms used for pathfinding.

3. 3.

   What is a greedy algorithm?

   • An algorithm that guarantees the best solution.
   • An algorithm that always makes the best choice in each step.
   • An algorithm that never backtracks.

   Hint

   Reflect on the nature of decision-making.

4. 4.

   True or False: The earliest finish time strategy is always optimal for interval scheduling.

   • True
   • False

   Hint

   Think of how overlaps may restrict choices.

5. 5.

   Design a greedy algorithm to solve the interval scheduling problem. Explain your steps.

   Hint

   Structure your answer in a step-by-step format.

6. 6.

   Provide a counter-example where a greedy choice does not yield the best result.

   Hint

   Think about cases where overlap affects the outcome.