recategorized by
1,572 views

5 Answers

1 votes
1 votes

 Merge Sort 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

0 votes
0 votes
Option A is correct. Merge sort uses divide and conquer approach .
Answer:

Related questions

5 votes
5 votes
5 answers
1
admin asked Mar 31, 2020
1,827 views
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...
2 votes
2 votes
1 answer
2
admin asked Mar 31, 2020
4,343 views
Which type of algorithm is used to solve the "$8$ Queens" problem ?GreedyDynamicDivide and conquerBacktracking
1 votes
1 votes
2 answers
3
admin asked Mar 31, 2020
1,926 views
The average search time of hashing, with linear probing will be less if the load factor :is far less than $1$equals $1$is far greater than $1$none of the options
2 votes
2 votes
4 answers
4