The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+14 votes

Merge sort uses:

  1. Divide and conquer strategy

  2. Backtracking approach

  3. Heuristic search

  4. Greedy approach

asked in Algorithms by Veteran (59.9k points)
edited by | 640 views

3 Answers

+18 votes
Best answer

 Answer: Option C.

One of the best examples of Divide and Conquer strategy.

answered by Boss (19.9k points)
edited by
Divide and conquer is option A
+1 vote
Option A ---> Merge sort

Merge sort is a divide and conquer algorithm.

It works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. So Merge Sort first divides the array into equal halves and then combines them in a sorted manner.
answered by (309 points)
0 votes

Option A ...

Some additional information ....

answered by Boss (12.3k points)
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
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 ...
@puja mishra your videos are very useful thanks

Related questions

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
47,894 questions
52,260 answers
67,678 users