Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
What are the difference between a stack and a queue?
Is list same as array?
Which searching algorithm is best?
How do you reference all the elements in a one-dimension array?
What are b tree keys?
Why heap sort is not used?
Mention a few applications of linked lists?
Which is the simplest file structure?
How many types of sorting algorithms are there?
What is the height of a binary tree?
Differentiate between queue and stack.
What do you mean by balanced trees?
What is linear and non linear structure?
Define left-in threaded tree?
What is difference between hashmap and map?
