Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1611 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 |
How do stacks work?
What is hashing in cyber security?
Differentiate between arraylist and linkedlist.
Which data structures are applied when dealing with a recursive function?
What are the types of binary tree?
Explain singly linked list in short.
What is a queue in data structure?
How many types of data structures are used?
State the rules to be followed during infix to prefix conversions?
What are the classification of data structures?
Are linked lists considered linear or non-linear data structures?
How do you find the time complexity of a bubble sort?
Windows 
