Home › MCQs › CSS Computer Science › Question #1129
Back to Questions
CSS Computer Science QUESTION #1129
Question 1
Which technique works by selecting the local optimal choice at each step?
  • Dynamic Programming
  • Divide and Conquer
  • Greedy Algorithm✔️
  • None of these
Correct Answer Explanation
A Greedy Algorithm makes the choice that looks best at the current moment with the hope that these local optimal choices will lead to a global optimum.