Interested to Buy Any Domain ? << Click Here >> for more details...
A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 33762 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
How do you access the values within an array?
What are the advantages of bubble sort?
What is meant by binary tree?
What do you mean by articulation point?
Is hashmap an array?
What are the advantages of array?
Write a program for Sorting an Array. Which sorting will you prefer?
What method is used to place a value onto the top of a stack?
List the data structures which are used in network data modal.
What is the non linear data structure?
Differentiate between singly and doubly linked lists?
What is heap and its types?
What is impact of signed numbers on the memory?
Why do we use collections?
Why insertion is faster in linked list?
