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 is bitonic search?
What do you mean by an Array?
What is treemap chart?
Does hashmap maintain insertion order?
Define avl tree?
What is example of data?
What are the objectives of studying data structures?
What is sorting problem?
What do you understand by doubly linked list?
List the area of applications of data structure.
What are the types of sorting?
Which sorting algorithm is best for large data?
What is a matrix?
How do you find the height of a binary tree?
How do signed and unsigned numbers affect memory?
