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
Can value be null in treemap?
What is difference between list and linked list?
What are control structures?
What is an array vs list?
What is impact of signed numbers on the memory using data structures?
How many parts are there in a declaration statement using data structures?
What are arrays used for?
What is heap tree in data structure?
How do you insert a new item in a binary search tree?
Is bucket sort a comparison sort?
Is hashmap a data structure?
Why do we need a data structure?
What is bubble sort with example?
How do you increase the capacity of an arraylist?
What is tree in computer science?
