Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1171 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
Define ancestor and descendant ?
Which is better stack or queue?
Two linked lists are given, find out the sum of them without altering the linked list?
Write a program to insert an element and in the specific position in the array?
Define articulation point?
Will it create any problem if we add elements with key as user defined object into the treemap?
What method removes the value from the top of a stack?
What are the classification of data structures?
How does the size of arraylist increases dynamically?
Which interfaces are implemented by hashmap?
Define heap order property?
Which sorting algorithm is best for large data?
What is the difference between Array and LinkedList?
What are different techniques for making hash function?
What is the use of threaded binary tree?
