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 is the Role of push() and pop() method?
How is heap sort implemented?
What are the disadvantages of circular list?
What do you mean by primary clustering?
What do you mean by collision in hashing?
Does arraylist have index?
In what data structures are pointers applied?
What are the types of sorting?
Can a class have a constructor?
How do you sort pseudocode?
Does treemap allow null values?
What are the best data structure courses for gate preparation?
Which collection type is used to maintain uniqueness of data structure?
When new data are to be inserted into a data structure?
What is heap tree in data structure?
