Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1474 Views
- Wipro, I also Faced
- E-Mail Answers
Answer / 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 |
What is difference between capacity and size of arraylist?
What is stable sorting method?
Explain singly linked list in short.
Does treemap allow null keys?
What is data structure definition?
Is treeset synchronized?
Two linked lists are given, find out the sum of them without altering the linked list?
Can we change load factor of hashmap?
Is file a data structure?
What are the types of algorithms?
Which sorting is used in collections sort?
Why heap sort is not used?
Windows 
