Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1457 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
Differentiate between hashmap and hashtable.
State the advantages of using infix notations?
What is the use of space complexity and time complexity?
How to inverting a function in sort and searching?
What is a queue in data structure?
Why do we use a multidimensional array in data structure?
How many sorting algorithms are there?
How do you insert a new item in a binary search tree?
What package is arraylist?
What do you mean by Runtime Error
How do you sort an array in descending order?
Explain the uses of b+ tree.
What is a stable sort?
Which is faster quick sort or merge sort?
Explain what is the data structures used to perform recursion?
