Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 736 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 are the basic operations of stack?
Explain linked list in short.
What is dynamic array with example?
What are linear and non linear data structures?
What actions are performed when a function is called?
What is hashing in cyber security?
List the abstract operations in the set?
Does arraylist shrink?
Differentiate between set and map.
Minimum number of queues needed to implement the priority queue?
How to find the duplicate in an array?
What is tree in computer science?
Windows 
