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
- 34357 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / sathyanarayana
Yes, its insertion sort. For a sorted array, it takes just
O(n) time. iTs mere traversal of an array as it is already
sorted. In the case of quick sort, it boils down to O(n^2)
in the case of sorted array.
| Is This Answer Correct ? | 5 Yes | 3 No |
Answer / 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 |
Answer / varma
insertion sort works efficiently on sorted lists.....
| Is This Answer Correct ? | 2 Yes | 1 No |
Answer / zeeshan
insertion sort shows best case behaviour when list is
already sorted.....
| Is This Answer Correct ? | 2 Yes | 1 No |
Answer / swetha
insertion sort is best one because it takes less time fot sorted array of elements.......
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / ronak & sandip
In this case, both insertion and bubble sort will work exactly same as the time complexity of both method is O(n). But you have to mention one condition to check any swap has been made inside or not...if no swap has been made, it will come out of loop after executing it n times.
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / soumitra biswas
modified bubble sort with flag.As the array is already sorted
there will be no swapping in first pass,so no comparison
will take place after first pass and program stops executing.
time complexity =0(n).
| Is This Answer Correct ? | 1 Yes | 1 No |
Are sets sorted?
Is hashset thread safe?
Why is the isempty() member method called?
Write a program to insert an element and in the specific position in the array?
Define balancing condition for AVL Tree.
What is a bubble sort and how do you perform it?
Which type of sorting is best?
What is quick sort example?
What is a simple path?
Can we override compareto method for enumerations?
What do you know about the big-o notation and can you give some examples with respect to different data structures?
Define non-linear data structures?
Windows 
