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 disadvantages array implementations of linked list?
What is the height of an empty tree?
State the advantages of using infix notations?
Explain the priority queue?
Explain different methods in which you can traverse a tree?
What is dynamic array in excel?
Define adjacent nodes?
Which file contains the definition of member functions?
What is a spanning tree in data structure?
Describe what is Node in link list? And name the types of Linked Lists?
What is the difference between list and arraylist?
What does it mean to sort an array?
How to inverting a function in sort and searching?
Define separate chaining?
What is the complexity of sorting algorithm?
