• A Dynamic programming
  • B Divide and conquer
  • C Greedy algorithms
  • D Breadth-first search
  • Share this MCQ