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
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Is heap sort stable?
Differentiate between failfast and failsafe.
What do you mean by priority queue?
What is a data structure? What are the types of data structures? Briefly explain them
How does arraylist size work?
What is difference between treeset hashset linkedhashset?
How do you implement a stack?
Explain the priority queue?
How does shell sort work?
Discuss the difference between a stack and an Array?
How to excel in data structures and algorithms?
Can treeset contain null?
What is meant by binary tree traversal?
List the types of rotations available in splay tree?
