A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 32044 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 will you free the memory that is allocated at run time?
How do you sort an arraylist?
What is the use of placement new?
What is bubble sort?
What do you mean by secondary clustering?
What is the minimum number of nodes in an avl tree of height h?
What are the tasks performed during postorder traversal?
How to sort an Array?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
What do you mean by collision in hashing?
What is time complexity of quick sort?
Is hashmap a collection?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
What stack means?
Does treeset allow null values?
