A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 31084 Views
- I also Faced
- E-Mail Answers
Answer Posted / sathya
Insertion sort works with an efficiency of O(n) if the array
is already sorted. Hence, this algo can be used.
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
Can you sort a hashmap?
What is mean by abstract data type?
Why null is allowed in hashmap?
What is non linear structure?
What is meant by balanced binary tree?
Explain about the different lists available in the collection?
What is the two-dimensional array?
How do you find the complexity of a bubble sort?
Explain the uses of matrix with an example?
What do you mean by Logical Error
What does enum do?
How do you sort an array in decreasing order?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
List the limitations of linear probing?
What do you mean by articulation point?
