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
- 34709 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 data structure and its classification?
How do you sort a list in reverse order?
For which header list, the last node contains the null pointer?
Write a program to reverse a single linked list.
What is stable sort?
What is doubly linked list?
Is python good for freshers?
Why is hashing used?
Which sorting does collections sort use?
Which is better bubble sort or selection sort?
Define general trees?
When is a binary search best applied?
How can we reverse a singly linked list?
How to inverting a function in sort and searching?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
