Explain about Merge Sort?
- 1 Answers
- 797 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 do you declare An array of three char pointers
Describe the complexity of Binary search
What is difference between data type and data structure?
Which is faster hashmap or hashtable?
What are stacks? Give some of its applications.
How do you use merge sort?
Can a stack be described as a pointer? Explain.
What are threaded binary trees?
What is difference between list and set?
What is data structure geeksforgeeks?
How many types of linked lists are there?
Write code for reversing a linked list.
Windows 
