Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1556 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 |
Is Arraylist faster than Array? Why?
What is structured data with example?
What is selection in an algorithm?
What is treemap chart?
what is the difference between Linear Array and Linked List?
What happens if we try to insert duplicate key in hashmap?
What is scalar data type?
Write an algorithm for inserting and deleting an element from doubly linked list?
What does the term sorting refer to?
Define shortest path?
What are examples of data structures?
Why quicksort is faster?
Windows 
