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
In what order the elements of a hashset are retrieved?
What is data structure and its classification?
Write a recursive c function to calculate the height of a binary tree.
How do you reference all the elements in a one-dimension array?
Where is binary tree used?
What is difference between list and array list?
Who created quicksort?
Define forest?
Differentiate between list and set.
What are the advantages of stack?
Which sort is stable?
What is the structure of an array?
What is the procedure to insert into a sorted array?
List the limitations of linear probing?
Which is faster list or set?
