Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1607 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 the difference between classifying and sorting?
Can we create a null as a key for a map collection?
What is variable size arrays?and why we use it?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is the difference between list and arraylist?
Why use a tuple instead of a list?
Write a Program for Reverse a linked list.
Why is hashmap used?
What does isempty() member method determines?
Why is quicksort faster than merge sort?
Which one is the simplest sorting in data structure?
What is return map?
What is the space complexity of quicksort?
How to sort an Array?
What's the difference between a hashtable and a hashmap?
