The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+13 votes
504 views

Merge sort uses:

  1. Divide and conquer strategy

  2. Backtracking approach

  3. Heuristic search

  4. Greedy approach

asked in Algorithms by Veteran (59.5k points)
edited by | 504 views

2 Answers

+16 votes
Best answer

 Answer: Option C.

One of the best examples of Divide and Conquer strategy.

answered by Boss (19.7k points)
edited by
0
Divide and conquer is option A
0 votes

Option A ...

Some additional information ....

answered by Boss (11.1k points)
0
Everyone of us knows the resources if u want to contribute genuinely at least learn from these video and then contribute by this way u can get points but no one get their right answer in shorter time ,thank you
0
Sorry i am nt getting wat do u want to say .... Thats a fairly easy question ... wat do u want me to contribute in a easy question ?? Reading other answers and posting that same answer ?? Everybody ?? No ...  U may know resources very well ... may be ... bt nt everyone ...
0
@puja mishra your videos are very useful thanks


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,440 questions
46,623 answers
139,371 comments
57,019 users