Explain divide and concquer method in data structure
Answers
Answered by
0
Data structure In computer science divide and conquer 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.
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.
Similar questions