Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1472 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 is sorting in math?
What are different types of sorting algorithms?
How to find middle element of linked list in one pass?
How can you insert a node in a random location of the linked list?
Explain the types of linked lists.
What is difference between while and do while?
Write the postfix form of the expression: (a + b) * (c - d)
What are the applications of b-tree?
How can you represent a linked list node?
What is difference between array and arraylist?
What is the limit of arraylist?
What is collections singletonmap?
Define a path in a tree?
What is sorted map?
What are the different types of sorting? Explain the difference between them.
