(a) Write and explain merge sort algorithm using divide and conquer s…
Previous year question for Analysis & Design of Algorithms.
Question
(a) Write and explain merge sort algorithm using divide and conquer strategy. Write a descriptive note on its best case, average case, and worst-case time efficiency.
(b) Specify the difference between divide and conquer strategy and dynamic programming.
- Year: 2022
- Subject: Analysis & Design of Algorithms