A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 30042 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
What do you mean by sorting?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
What is stack explain with diagram?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
What is the function of stack?
What are the two types of data?
Define a binary tree?
Can binary tree have 1 child?
What is the purpose of sorting algorithms?
What are different techniques for making hash function? Explain with example.
Can you store different types in an array?
What is adt in data structure with example?
Why do we use arrays?
Differentiate between hashset and treeset.
Differentiate between list and map.
