A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 30040 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
Does hashmap sort automatically?
Can you please explain the difference between array_name and &array_name?
Which sort is best for linked list?
What are the advantages of binary search over linear search?
Can we add or delete an element after assigning an array?
How to get largest and smallest number in an array?
Is selection sort greedy?
What is treemap chart?
Differentiate between list and set.
What are the standard ways in which a graph can be traversed?
What is impact of signed numbers on the memory using data structures?
Explain what is the bucket size, when the overlapping and collision occur at same time?
What is merge sort and how it works?
Define collision in hashing?
Does map extend iterable?
