Interested to Buy Any Domain ? << Click Here >> for more details...
A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 31918 Views
- I also Faced
- E-Mail Answers
Answer Posted / vinoth kumar.r
Quick sort's worst case is the one given in the question.
It exhibits selection sort type of procedure when the list
is sorted
Hence both :)
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
Explain the implementation of an AVL tree and Binary tree.
Why hashtable is faster than arraylist?
What is a 2 dimensional array?
Is quicksort faster than merge sort?
How many types of data structures are used?
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
List out the applications of a linked list?
How is bubble sort done?
How to sequentially represent max-heap?
Can you have an arraylist of arrays?
Explain how is linked list implemented?
What are linked lists used for?
Is hashmap keyset ordered?
How does variable declaration affect memory allocation?
What is collection sort?
