A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 31110 Views
- I also Faced
- E-Mail Answers
Answer Posted / sarvesh
insertion is answer....as there is no case of swapping as
no. are in ordered pair..so less time will will be taken
| Is This Answer Correct ? | 1 Yes | 2 No |
Post New Answer View All Answers
Different Types of pattern?
Define threaded binary tree.
Can you please explain the difference between array_name and &array_name?
Differentiate between push and pop?
If I try to add enum constants to a treeset, what sorting order will it use?
Does treemap allow null key?
How can I search for data in a linked list?
Advanced problems related to Data Structures were asked
Describe the complexity of Quick Sort
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
Which interface treemap implements?
What is difference between list and array?
Is array a linked list?
What is peek in stack?
Which is better selection or bubble sort?
