Interested to Buy Any Domain ? << Click Here >> for more details...
Explain about Merge Sort?
- 1 Answers
- 1435 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
Is char array null terminated?
What are the advantages and disadvantages of linked list over array?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
wt is a datastructure
What are data and data types?
Why do we use linked lists?
How to get the index of an array element?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Which is the parent class of abstractsequentiallist class?
What is bubble sort?
Why do we need linked list?
Where is data structure used?
Windows 
