Interested to Buy Any Domain ? << Click Here >> for more details...
Describe the merge sort principle and what will be its time complexity?
- 1 Answers
- 1606 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 |
When new data are to be inserted into a data structure?
Do you know how to find if linked list has loop?
How would you reverse the characters of an array?
What is a map programming?
Define balanced trees?
Explain about the types of linked lists
What is a hashers run?
Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.
What are data members?
What is bubble sort and quick sort?
In Data Structure, write output of given program.
0 Answers HPCL, Hughes Systique Corporation,
Are linked lists considered linear or non-linear data structures?
Windows 
