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
Why is hashmap not thread safe?
Can arraylist contain duplicates?
How would you use qsort() function to sort the name stored in an array of pointers to string?
Can we make hashmap synchronized?
What are the advantages of linked list over an array?
What are the 3 types of measurement?
Is linked list faster than array?
What is array and structure?
Why is it important to sort waste?
What is binary tree and its types?
Is map a collection?
How can we delete the first node from the singly linked list?
What is the relationship between a queue and its underlying array?
How would you reverse characters of an array without using indexing in the array.
Can you sort a hashmap?
