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
Is red black tree balanced?
How do you define a set?
Is arraylist a class?
What is data algorithm?
What is circular queue in data structure?
Write the postfix form of the expression: (a + b) * (c - d)
What are the types of queues?
Is array of data structure?
Which sorting technique is best in worst case?
What is the non linear data structure?
How do you solve a selection sort?
Which is the slowest sorting algorithm?
What is the use of data structure?
Is boolean a data type?
How do you increase the capacity of an arraylist?
