Answer to Question #52162 in Other Programming & Computer Science for irebami
Which of the following algorithms works by recursively breaking down a problem into two or more sub-problems of the same type?
Quicksort Mergesort divide and conquer Binary
Incomputer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.