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 difference between arraylist and linkedlist?
List the applications of set adt?
What is data structure geeksforgeeks?
What is the use of data structure?
Describe the types of data structures?
How are the elements of a 2d array are stored in the memory?
Why you need a data structure?
Construct a doubly linked list using a single pointer in each node?
How does a hashtable work?
Write the stack overflow condition.
Define a set?
Describe the height term in a tree.
Parenthesis is never required in postfix or prefix expressions, why?
Which sorting is stable?
How can you insert a node at the end of linked list?
