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
- 34404 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 |
Describe the degree term in a tree.
Can arraylist hold duplicates?
How does a hashtable work?
Can arraylist be resized?
Can treeset contain null?
State the advantages of using postfix notations?
Which data structure is used in arraylist?
How does variable declaration affect memory allocation?
What is sorting with example?
What is stable sort?
Why do we use different types of data structures?
Can we use Generics with the array?
Windows 
