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
How to reverse a linked list iterative algorithm?
Explain the internal working of a hash map?
How to inverting a function in sort and searching?
What is time complexity of quick sort?
Which collection is fail safe?
What is data and its type?
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
Explain linked list in short.
What is the meaning of arraylist?
What is an ordered list?
What is sort function?
What is a undirected graph?
What is sorting with example?
What are the different types of data type?
How efficient is bubble sort?
