Interested to Buy Any Domain ? << Click Here >> for more details...
Explain about Merge Sort?
- 1 Answers
- 1501 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 |
How many types of linked list are there?
How can I study data structures and algorithms?
What is hashing technique? Describe in brief.
How is bubble sort done?
How would you implement two stacks using a single array?
What package is arraylist?
Write an algorithm to find middle element in the linked list.
To describe the Complexity of Binary search, Quicksort and various other sorting and searching techniques..
0 Answers HPCL, Hughes Systique Corporation,
what is the need of data structure
What is a stable sort?
Can nsarray contain nil?
Is treeset sorted?
Windows 
