Interested to Buy Any Domain ? << Click Here >> for more details...
Explain about Merge Sort?
- 1 Answers
- 1426 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 |
What is the bucket size, when the overlapping and collision occur at the same time?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
Is map a data structure?
To describe the Complexity of Binary search, Quicksort and various other sorting and searching techniques..
0 Answers HPCL, Hughes Systique Corporation,
what are the applications that use Linked lists?
Can a hashset contain duplicates?
Which sorting technique is best in worst case?
What is the impact of signed numbers on the memory?
What are the difference between arraylist and linkedlist from the perspective of sorting?
How do we find duplicate elements in an array?
What do you mean by sorting?
How do you insert a new item in a binary search tree?
Windows 
