Skip to content
Related Articles

Related Articles

ISRO | ISRO CS 2011 | Question 66
  • Last Updated : 11 May, 2018

Which of the following algorithm design technique is used in merge sort?
(A) Greedy method
(B) Backtracking
(C) Dynamic programming
(D) Divide and Conquer

Answer: (D)

Explanation: Merge sort uses Divide and Conquer approach to sort the elements. Array is recursively divided in two halves till the size becomes 1. Once the size of array becomes 1, the merge process comes into action and starts merging the arrays back till the complete array is merged.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :