ISRO CSE 2011 | Question: 66

Question

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 1

In Merge Sort we are keep on deviding the Array (can be any other Data Structure) into individual element.

Then Applying Merge Operation subsequently.

Then keeping on Combining the Solution.

So, Merge Sort Uses Divide & Conquer Method.

Hence,Option D is Ans.

Answer 2

ans is (d)

MergeSort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merg() function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one. 

Comments

Merge sort uses divide and conquer approach