Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 767 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
What does map stand for?
What are the applications of stack?
Which interfaces are implemented by enumset?
Is treeset synchronized?
Which language is best to learn data structures?
Where is binary tree used?
Write program for Quick sort ?
Why would we use dynamically allocated arrays vs vectors?
What is stable sorting?
What is the prerequisite for binary searching?
What is the minimum number of nodes that a binary tree can have?
What are the 3 types of measurement?
What is an example of an array?
How will you check the validity of an expression containing nested parentheses?
What do you mean by structure property in a heap?
