Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1455 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 many parts are there in a declaration statement using data structures?
What is binary tree and its types?
Explain the sorting algorithm that is most suitable to be used with single linked list?
What is the difference between hashset and treeset?
What is the difference between set and unordered_set?
How many types of data structure are there?
Which collection allows null values?
What type of variable is age?
What is data structure definition?
What do u mean by array?
Why linked list is required?
Is it necessary to sort a file before searching a particular item ?
Windows 
