Explain about Merge Sort?
- 1 Answers
- 801 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 |
How efficient is binary search?
What does list clear do?
What are the disadvantages of linear list?
Does treeset allow duplicates?
How can you insert a node to the beginning of a singly linked list?
Why sorting is done?
What is pivot in quicksort?
What is the difference between binary tree and binary search tree?
What is meant by arraylist?
Is learning data structures necessary?
What does each entry in the link list called?
Should I use hashmap or hashtable?
Windows 
