recategorized by
4,952 views

2 Answers

2 votes
2 votes
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.
Answer:

Related questions

18 votes
18 votes
2 answers
1
Kathleen asked Oct 8, 2014
8,457 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 ...
7 votes
7 votes
2 answers
2
go_editor asked Jun 23, 2016
7,827 views
Which of the following algorithm design technique is used in merge sort?Greedy methodBacktrackingDynamic programmingDivide and Conquer
35 votes
35 votes
6 answers
3
Kathleen asked Oct 8, 2014
47,611 views
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)$
21 votes
21 votes
1 answer
4
Kathleen asked Oct 8, 2014
3,904 views
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 ...