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
- 33770 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 |
write a program to accept name & sort them?
List the applications of set adt?
Which is the slowest sorting algorithm?
What does a treemap do?
Does hashset maintain order?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
What is entryset in hashmap?
What is binary tree give example?
What are stacks? Give some of its applications.
How does hashset work internally in java?
Will arraylist maintain insertion order?
What do you mean by probing?
Windows 
