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 concept of data structure?
State the difference between arrays and linked lists?
Write the stack overflow condition.
What is a pass in bubble sort?
Which one is the simplest sorting in data structure?
What are three common types of traversals?
What is lifo?
What is difference between arraylist and list?
What is data and data structure?
What is bubble sort algorithm?
What is hashing technique?
Data structure used to implement a menu
What is the difference between ienumerable and list?
What are different types of sorting techniques?
Which is faster hashmap or linkedhashmap?
