A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 27801 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
What is an object array?
What is declaring array?
Can you provide some implementation of a dictionary having large number of words?
Mention one advantage and disadvantage of using quadratic probing?
Can we use any class as map key?
Differentiate between hashset and hashmap.
What is data and information explain with example?
What is the use of tree data structure?
How do you initialize an arraylist?
How does sort function work?
What is a reverse linked list.
What type of algorithm is binary search?
What are the difference between a stack and a queue?
Why is quicksort faster than merge sort?
What is sort order?
