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
- 34187 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
Explain stacks and queues in detail.
What is array define its types?
Describe stack operation.
Are collections thread safe?
What do you mean by Runtime Error
Explain the common uses of tree database.
What is data in computer science?
What is difference between hashmap and arraylist?
How is any data structure application is classified among files?
How can avl tree be useful in all the operations as compared to binary search tree?
Define hash function?
What do you know about traversal in linked lists?
Is arraylist better than array?
What is a subtree?
Is tuple immutable?
