Interested to Buy Any Domain ? << Click Here >> for more details...
Explain about Merge Sort?
- 1 Answers
- 1409 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 |
What are different types of sorting techniques?
What are the advantages of bubble sort?
What is the difference between 1d and 2d array?
What are the different types of data structures explain briefly?
Can we define the size of arraylist?
What are the types of binary tree?
Which interfaces are implemented by linkedlist?
Can we search the data in a linked list?
Write an algorithm to find middle element in the linked list.
applications of stacks and their uses?
Can we increase the size of statically allocated array?
What is nonlinear data?
Windows 
