A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 27770 Views
- I also Faced
- E-Mail Answers
Answer Posted / zeeshan
quick sort is the answer.....quick sort shows worst case
behaviour when the list is already sorted....
courtesy"" shaum series- data structures""
| Is This Answer Correct ? | 15 Yes | 0 No |
Post New Answer View All Answers
Can we use any class as map key?
Describe binary tree and its property.
Where is insertion sort used?
How many sorting are there in data structure?
What is complexity algorithm?
How to excel in data structures and algorithms?
Describe tree database. Explain its common uses.
Does treemap allow null key?
What do you mean by secondary clustering?
If we try to add duplicate key to the hashmap, what will happen?
What is the default size of arraylist?
Can arraylist hold different types?
Does hashset allow duplicates?
How many null values are allowed in hashmap?
Define a linear and non linear data structure.
