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 is insertion sort technique?
Differentiate between an array and an arraylist.
Does mentioning the array name gives the base address in all the contexts?
Why do we use hashmap?
What is the space complexity of bubble sort?
What is dynamic array how is it created?
What is the use of sorting?
Is arraylist a collection?
What is the difference between data types and data structures?
What is the difference between ienumerable and list?
Which collection allows null values?
Can a binary tree be empty?
Define non-linear data structures?
What is impact of signed numbers on the memory using data structures?
Why linked lists are better than arrays?
