Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1549 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
Where is binary tree used?
Is hashmap sorted?
List the types of tree.
What is meant by binary tree traversal?
How do arrays work?
What is integer max_value?
Is radix sort stable?
What is bubble sort and selection sort?
List out the advantages of using a linked list?
Explain binary representation?
Can map contain duplicate keys?
What is dynamic array in excel?
Windows 
