A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
Answer Posted / varma
insertion sort works efficiently on sorted lists.....
| Is This Answer Correct ? | 2 Yes | 1 No |
Post New Answer View All Answers
What is stack and queue in data structure?
What method removes the value from the top of a stack?
What is stack push?
Write a program for reversing the Single Linked List?
What is precision in data structures?
Define non-terminal nodes in a tree?
What is the use of data structure?
Define 2-3 tree?
Write a Program for Insert in a sorted list
What does the dummy header in the linked list contain?
Why is sorting necessary?
What is difference between set and map?
Write the steps involved in the insertion and deletion of an element in the stack.
Which is faster array or linked list?
How to initialize Dictionary using collection initialize?