A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 30010 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
What is array sort?
What is an iterative algorithm?
What are the disadvantages of linked list over array?
What is the non linear data structure?
What is the application of queue?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
What is difference between hashmap and hashtable?
What is sequential sorting?
Write the postfix form of the expression: (a + b) * (c - d)
Can arraylist shrink?
What is meant by a dynamic array?
Can a stack be described as a pointer? Explain.
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
How does the bubble sort work?
What is a data structure definition?
