Explain about Merge Sort?
- 1 Answers
- 1043 Views
- I also Faced
- E-Mail Answers
Answer / rohit sah
Merge-sort is based on the divide-and-conquer paradigm. The Merge-sort algorithm can be described in general terms as consisting of the following three steps:
1. Divide Step
If given array A has zero or one element, return S; it is already sorted. Otherwise, divide A into two arrays, A1 and A2, each containing about half of the elements of A.
2. Recursion Step
Recursively sort array A1 and A2.
3. Conquer Step
Combine the elements back in A by merging the sorted arrays A1 and A2 into a sorted sequence.
We can visualize Merge-sort by means of binary tree where each node of the tree represents a recursive call and each external nodes represent individual elements of given array A. Such a tree is called Merge-sort tree. The heart of the Merge-sort algorithm is conquer step, which merge two sorted sequences into a single sorted sequence.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is file a data structure?
Can hashmap have same key?
How do you use merge sort?
What are the different binary tree traversal techniques?
What are the major data structures used in the rdbms?
What is meant by int?
example of linear and non-linear data structures?
Write a Program for Reverse a linked list.
What is two-dimensional array?
What is stack push?
What does the dummy header in the linked list contain?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
Windows 
