Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1516 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 different types of sorting in data structure?
What are the applications of stack?
How will you explain circular linked list?
How does hashset maintain order?
State the different types of linked lists?
Define an algorithm. What are the types of algorithms?
Define left-in threaded tree?
What are the issues that hamper the efficiency in sorting a file?
How to excel in data structures and algorithms?
What is difference between hashset and treeset?
What is the difference between arraylist and linkedlist?
Stack can be described as a pointer. Explain.
Windows 
