A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 31976 Views
- I also Faced
- E-Mail Answers
Answer Posted / varma
insertion sort works efficiently on sorted lists.....
| Is This Answer Correct ? | 2 Yes | 1 No |
Post New Answer View All Answers
Differentiate between list and set.
What are the best data structure courses for gate preparation?
Can a class have a constructor?
What is frozenset?
What is heap tree explain with example?
What is the Insertion Sort Code?.
What is breadth first tree?
Define distributed query and linked server?
Why is quicksort faster than merge sort?
Why do we need algorithm?
What is list and its types?
What is the difference between dictionary and hashtable?
What are the disadvantages of representing a stack or queue by a linked list?
What sort of serious problems have you experienced, and how have you handled them?
Can we define the size of arraylist?
