Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1536 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Is list a data structure?
What is the difference between list, set and map?
What is a subtree?
What do you mean by separate chaining?
What is a undirected graph?
State the different types of linked lists?
Can we add heterogeneous elements into treemap?
What is scalar data type?
How hashmap increases its size?
List the applications of set adt?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
Is it possible to make an array volatile in java?
Can you declare an array without assigning the size of an array?
What is an expression tree?
What are the difference between arraylist and linkedlist from the perspective of sorting?
