edited by
7,827 views

2 Answers

Best answer
10 votes
10 votes
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.
selected by
1 votes
1 votes

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. 

Answer:

Related questions

21 votes
21 votes
2 answers
1
Kathleen asked Oct 8, 2014
4,952 views
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
5 votes
5 votes
5 answers
2
go_editor asked Jun 22, 2016
5,000 views
Consider the following pseudocodex:=1; i:=1; while ( x <= 500) begin x:=2^x; i:=i+1; endWhat is the value of $\textsf{i}$ at the end of the pseudocode?$4$$5$$6$$7$
8 votes
8 votes
1 answer
3
shivanisrivarshini asked May 31, 2016
11,385 views
Let $T(n)$ be defined by $T(1) =10$ and $T(n+1)=2n+T(n)$ for all integers $n \geq 1$. Which of the following represents the order of growth of $T(n)$ as a function of $n...
3 votes
3 votes
2 answers
4
ajit asked Oct 1, 2015
6,876 views
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L isLL/2(L+1)/22L