Answer Posted / bharath
on avg qsort is O(n) and worst is n^2;
msort is O(nlogn) for all
hsort is same as msort
| Is This Answer Correct ? | 6 Yes | 3 No |
Post New Answer View All Answers
What is a directed graph?
Explain the term run-time stack?
List the area of applications of data structure.
How will you check the validity of an expression containing nested parentheses?
What is heap and its types?
When is a binary search algorithm best applied?
What is selection in an algorithm?
Why is it called bubble sort?
Which language is best to learn data structures?
How would you sort words in a large file?
Is any implicit arguments are passed to a function when it is called?
What is dequeue operation?
You want to insert a new item in a binary search tree. How would you do it?
Which is best book for data structures?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential