A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 30012 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 are different techniques for making hash function? Explain with example.
Explain the types of linked lists.
How do you balance a tree?
Define balancing condition for AVL Tree.
Is array a linked list?
What are the advantages of linked list?
Differentiate between arraylist and vector.
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
Explain what is the type of the algorithm used in solving the 8 queens problem?
How do you use merge sort?
How does insertion sort works?
In what data structures are pointers applied?
What are the properties of binary heap?
What package is arraylist?
What are the four characteristics of algorithms?
