Question #52144

Which of the options is an example of divide-and-conquer paradigm?

a. Quicksort

b. Mergesort

c. Binary

d. All of the options

a. Quicksort

b. Mergesort

c. Binary

d. All of the options

Expert's answer

Many useful algorithms arerecursive in structure, they makes a recursive call to itself until a base (or

boundary) condition of a problem is not reached. These algorithms closely

follow the divide-and-conquer approach. Applications of divide-and-conquerstrategy are Binary search, Quick sort,Merge sort, multiplication of two n-bit

numbers and V. Strassen‘s matrix multiplications.

Learn more about our help with Assignments: Programming & Computer Science

## Comments

## Leave a comment