Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1197 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
How to find the duplicate in an array?
What are linear and non linear data structures?
What is the impact of signed numbers on the memory?
How to create an Array?
Is stack a dynamic data structure?
What is a stable algorithm?
Can you dynamically allocate arrays in expanded memory?
Does hashset guarantee order?
Define depth and height of a node?
Is hashmap faster than arraylist?
What do you mean by general trees?
What are the categories of avl rotations?
Why is arraylist used?
What do you mean by 2-3 tree?
How does a hashmap work?
