Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1546 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 iterator and enumeration.
What do you mean by shortest path?
Devise a program to sort an array using bubble sort.
What are different techniques for making hash function? Explain with example.
Define non-linear data structures?
What is array traversing?
What do you mean by linear probing?
Explain the difference between a list and array.
List some applications of multilinked structures?
Differentiate between iterable and iterator.
Is it possible to store null key and null values in a hashmap?
Which interfaces are implemented by concurrentskiplistset?
List the types of rotations available in splay tree?
What is a map programming?
Is binary tree balanced?
