# GATE1995-1.5

1.5k views

Merge sort uses:

1. Divide and conquer strategy

2. Backtracking approach

3. Heuristic search

4. Greedy approach

edited

One of the best examples of Divide and Conquer strategy.

edited
1
Divide and conquer is option A
0
Typo ? correct it plz.
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.

Option A ...

1
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

Hope it helps :)

## Related questions

1
1.1k views
Consider the following sequence of numbers:$92, 37, 52, 12, 11, 25$ Use Bubble sort to arrange the sequence in ascending order. Give the sequence at the end of each of the first five passes.
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
In the following Pascal program segment, what is the value of X after the execution of the program segment? X := -10; Y := 20; If X > Y then if X < 0 then X := abs(X) else X := 2*X; $10$ $-20$ $-10$ None