Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1127 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 |
Can we put null key in hashmap?
What is a comparator function?
Define the graph data structure?
What are linear and non linear data structures?
How do you empty an arraylist?
What is adt and its advantages?
Can we modify final arraylist?
What is tree in computer science?
Write programs for Bubble Sort, Quick sort
Define balanced trees?
How many types of linked lists are there?
how to find the number of possible tree in the given tree.
12 Answers Persistent, TCS, Wipro,
Windows 
