Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 740 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 |
Why is arraylist faster than linkedlist?
What is different between array and list?
Will it create any problem if we add elements with key as user defined object into the treemap?
List the area of applications where stack data structure can be used?
What is ordered map?
What are scalar values?
Does treemap allow null values?
How treemap orders the elements if the key is a string?
How do treesets work internally?
Can list contain null values?
Is heap sort faster than quicksort?
Can you please explain the difference between string and an array?
Windows 
