A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 30016 Views
- I also Faced
- E-Mail Answers
Answer Posted / rohit
Bubble sort with a flag variable to check if comparisons
occur or not. If it is already sorted then in just 1
iteration it will show that the array is sorted which is
not possible in any other sort.THUS JUST 1 ITERATIION IS
REQUIRED IN THIS CASE.
| Is This Answer Correct ? | 27 Yes | 2 No |
Post New Answer View All Answers
What are the types of bulleted list?
What are the benefits of using arrays?
Explain how is linked list implemented?
List the data structures which are used in rdbms.
Which sorting algorithm is the slowest?
How many types of arrays are there in visual basic?
What is stack push?
What is data structure definition?
What are the difference between a stack and a queue?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
How can a binary tree be represented using the rotation?
Define a Deque?
What is the best sorting technique?
How do you get placements?
Explain the uses of b+ tree.
