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
- 34371 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / sourav naskar
quick sort cant be the answer as this methods works best
when the list is completely unsorted.In this the method
would have worked best if it is descendingly sorted.As it
is completely sorted the answer is insertion sort which
takes O(n).
| Is This Answer Correct ? | 1 Yes | 2 No |
Answer / sarvesh
insertion is answer....as there is no case of swapping as
no. are in ordered pair..so less time will will be taken
| Is This Answer Correct ? | 1 Yes | 2 No |
Answer / gautam
heap sort is the correct answer because it requires log(n)
time where n is the number of nodes
| Is This Answer Correct ? | 0 Yes | 1 No |
What are common data structures?
What is binary search in data structure?
Why is reflection slower?
What is impact of signed numbers on the memory?
What is the limit of arraylist?
What is difference between hashset and linkedhashset?
What is a tech stack?
Differentiate between hashset and treeset.
What is 1d array?
How helpful is abstract data type of data structures?
Which is better stack or queue?
Difference between calloc and malloc ?
Windows 
