Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1535 Views
- Wipro, I also Faced
- E-Mail Answers
Describe the merge sort principle and what will be its time complexity?..
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 |
More Data Structures Interview Questions
Which sorting technique is faster?
Why quicksort is called quick?
What is heap tree?
What are the standard ways in which a graph can be traversed?
How many types of arrays are there?
What do you mean by union-by-weight?
How many parts are there in a declaration statement using data structures?
Can map contain duplicate keys?
Why is tuple immutable?
What are linked list?
What are the major data structures used in the rdbms?
why boundary tag representation is used?
Windows 
