Q: Which of the following is a disadvantage of a greedy algorithm?

A It always guarantees the optimal solution
B It can be slow for large input sizes
C It requires a lot of memory
D It may not always find the globally optimal solution

Share this MCQ

Answer: D

Explanation:

Answer: It may not always find the globally optimal solution

Explanation: A greedy algorithm may not always find the globally optimal solution since it makes locally optimal choices at each step without considering the future consequences. This can lead to suboptimal solutions for some problems.

Greedy Algorithms

Share Above MCQ

‹ Previous Next ›

Write your comment

Learn More MCQ Questions from Data Structure Greedy Algorithms

Q: Which of the following is a disadvantage of a greedy algorithm?

Report Question