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
How do you sort an array by value?
What is the need for extendible hashing?
Difference between calloc and malloc in data structures?
What are the disadvantages of linked list?
How can we delete any specific node from the linked list?
What does the term sorting refer to?
What is rule regarding overriding equals and hascode method?
What data type is enum?
How do I use quick sort?
What are the tasks performed during postorder traversal?
What is non linear data structure with example?
Write an algorithm for inserting and deleting an element from doubly linked list?
Tell me why might quick sort might be better than merge sort?
what is Linked lists?
What is the Difference between treemap and hashmap?