Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 738 Views
- Wipro, I also Faced
- E-Mail Answers
Answer / shagun
Merge sort is basically work on divide and conquer approach i.e divide,conquer ,combine and time complexity of merge sort is o(nlogn) where log n is the height of the tree and n = no of elements
| Is This Answer Correct ? | 0 Yes | 0 No |
What is stack explain with diagram?
What is the idea behind splaying?
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
19 Answers ABB, SDE,
What is complexity algorithm?
Is array a collection?
What is a cycle or a circuit?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
How can you insert a node to the beginning of a singly linked list?
How to reference all the elements in a one-dimension array?
What is data structure geeksforgeeks?
Describe the merge sort principle and what will be its time complexity?
Which is faster list or set?
Windows 
