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 applications of priority queues?
What are the advantages of selecetion sort?
Which sorting technique is best?
What are the different data structures?
Is an arraylist an object?
What are the applications of stack?
Difference between hashset and treeset?
Does arraylist have a tostring?
What are the average and worst time complexity in a sorted binary tree is
Tell me can the size of operator be used to tell the size of an array passed to a function?
Explain the Stack
What is binary tree and its properties?
what is a balanced tree.
Parenthesis is never required in postfix or prefix expressions, why?
What do you mean by selection sort?
