Identify the correct definition of Greedy algorithm.
- A. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.
- B. A simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order.
- C. An algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum. ✓
- D. An algorithm design paradigm that breaks a problem into smaller subproblems, solves them, and combines the results.
Correct answer
C. An algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum.
Explanation
Greedy algorithm refers to an algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum.