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 array size dynamic or fixed?
What is binary tree used for?
What is non linear data structure with example?
What type of algorithm is binary search?
Can arraylist hold different types?
What are the five examples of data?
Does linked list allow null values?
What are the advantages of merge sort?
Briefly explain recursive algorithm?
What do you mean by hash table?
Differentiate between list and set.
Why is arraylist faster than linkedlist?
What are data and data types?
Can a binary tree be empty?
Can hashmap have same key?
