Answer Posted / bharath
on avg qsort is O(n) and worst is n^2;
msort is O(nlogn) for all
hsort is same as msort
| Is This Answer Correct ? | 6 Yes | 3 No |
Post New Answer View All Answers
What is a hashset?
Why is hashset not ordered?
What are the basic operations of stack?
What are the disadvantages of circular list?
What is a minimum spanning tree?
Write an algorithm to find middle element in the linked list.
What is the difference between set and unordered_set?
What is default size of hashmap?
Why insertion is faster in linked list?
what are the applications of Linked Lists?
What is application of data structure?
What is sorting rule in shapes?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Is hashmap synchronized?
What are priority queues?