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
- 33665 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 a map programming?
Define right-in threaded tree?
Is arraylist synchronized?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
How will you sort the elements of array in descending order?
What are types of Collision Resolution Techniques and the methods used in each of the types?
Define articulation point?
How would you check if a binary tree is BST or not ? Write a program.
What is array define its types?
What do you mean by sorting data?
Are data structures important?
What is meant by deque?
Can we put null key in hashmap?
What is binary search in data structure?
What is the best data structure and algorithm to implement cache?
