Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 755 Views
- Wipro, I also Faced
- E-Mail Answers
Describe the merge sort principle and what will be its time complexity?..
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 |
More Data Structures Interview Questions
Is bucket sort stable?
How do you sort a collection in descending order?
Which is faster array or list?
What is meant by a dynamic array?
Are hash tables ordered?
Define the tree data structure.
Is unordered_map a hash table?
What is linked list with example?
Can binary tree have 1 child?
Which is the parent class of abstractqueue class?
why boundary tag representation is used?
Explain pre-order and in-order tree traversal.
Windows 
