Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / manoj ransing
The worst case behaviour or quick sort is n^2, but that of
heap sort is nlogn. The average case for both is nlogn.
| Is This Answer Correct ? | 3 Yes | 10 No |
Post New Answer View All Answers
What are the Difference between tcp and udp?
What are the tasks performed during postorder traversal?
What type of memory allocation is referred for Linked lists?
Is treemap sorted?
Explain what is binary search?
Are linked lists useful?
What is advantage and disadvantage of linked list?
What is the idea behind splaying?
Define ancestor and descendant ?
Is quicksort a stable algorithm?
What is the easiest sorting method to use in data structures?
What are common data structures?
What are linear and non linear data structures?
What exactly is a thread?
What are the two types of data?
