🎴 Flashcard Mode
Divide and Conquer Algorithms
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which of the following is a Divide and Conquer Algorithm?
AnswerClick to flip back
A
Merge Sort
💡 Explanation:
Merge Sort is a Divide and Conquer Algorithm because it follows the divide-and-conquer paradigm, where the problem is divided into smaller subproblems, solved recursively, and then the solutions are combined to solve the original problem.