Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 756 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
What is pivot in quicksort?
Write a program to sum values of given array.
List all data structures you would use for a memory management module.
What are the disadvantages of linear list?
What is the capacity of arraylist?
Are linked lists considered linear or non-linear data structure?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Why is treeset sorted?
Define primary data structures?
What differences exist between hashmap and hashtable?
Which sorting has less time complexity?
Explain in brief a linked list.
What is a stable algorithm?
Where will be the free node available while inserting a new node in a linked list?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
