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
Explain recursive function & what is the data structures used to perform recursion?
What is two-dimensional array?
What is the height of an empty tree?
How does selection sort work?
Write a Program for Insert in a sorted list
Does list allow null values?
What is the difference between hashmap and arraylist?
Check if duplicates exist in an array of N which has range 1 to N.
Tell me can the size of operator be used to tell the size of an array passed to a function?
What is time complexity of binary search?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
What do you mean by priority queue?
Is a hash table a map?
For searches. Which one is most preferred: array list or linked list?
Explain about circular linked list?
