Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 747 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
Why do we need to use computers to help us sort lists?
Why is quicksort not stable?
Write an algorithm for inserting and deleting an element from doubly linked list?
Mention for which header list, you will found the last node contains the null pointer?
Can arraylist store objects?
Is it possible to insert different type of elements in a stack? How?
What is bubble sort and quick sort?
What is a priority queue?
What is difference between hashmap and arraylist?
Can a class have a constructor?
What are the main differences between the linked list and linear array?
What do you mean by hash table?
What is sorting and its types?
Define threaded binary tree. Explain its common uses
Which interfaces are implemented by enumset?
