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
- 34355 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 is push and pop in stack?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Which of the collections allows null as the key?
What is a static structure?
What is array and structure?
What are the disadvantages of representing a stack or queue by a linked list?
Define outdegree of a graph?
List the types of rotations available in splay tree?
What is raid (redundant array of inexpensive disks)? Explain its level?
How to search binary in a sorted array?
Is quicksort a stable algorithm?
List out the applications of a linked list?
What is meant by int?
Is set sorted?
How do you sort pseudocode?
