Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / srinvias
Merge sort. In all the cases the complexity is nlogn
For Quick sort complexity is o(n^2), nlogn in worst and best
cases respectively.
| Is This Answer Correct ? | 14 Yes | 5 No |
Post New Answer View All Answers
Define a stack?
List the applications of set adt?
What is a singletonlist?
What are the major data structures used in the network data model?
Is quicksort divide and conquer?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
Which sorting algorithm is used in collections sort?
Mention the data structures which are used in graph implementation.
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
what is the difference between dynamic as well as non - dynamic data structures.
How do you find the complexity of a bubble sort?
What is the difference between a hashmap and hashtable?
What is a Queue? Explain its operation with example?
How treemap orders the elements if the key is a string?
What is immutablelist?
