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
- 34403 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
Define heap order property?
What is binary tree example?
What is dequeue in data structure?
Explain implementation of traversal of a binary tree.
Differentiate between singly and doubly linked lists?
What is array indexing?
What does sorting an array do?
Which interfaces are implemented by linkedhashset?
How to find the duplicate in an array?
Who created quicksort?
Define a relation?
What is a vector class?
Which sorting is best for large data?
Differentiate between the singly linked list and doubly linked list.
What is a data structure node class?
