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
Which sorting is best for large data?
When will you use array over arraylist?
What are the tasks performed while traversing a binary tree?
Will it create any problem if we add elements with key as user defined object into the treemap?
Define data type and what are the types of data type?
State the rules to be followed during infix to prefix conversions?
Can you list out the areas in which data structures are applied extensively?
State the advantages of using postfix notations?
Define in brief an array.
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
What is the difference between hashset and hashtable?
What is data and information explain with example?
Define separate chaining?
Is arraylist synchronized?
What is stable sorting?
