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 longest time to execute?
- 12 Answers
- 31417 Views
- I also Faced
- E-Mail Answers
Answer Posted / ntrphanikumar
I am not sure about the answer.
But I think the answer is "Selection Sort" whose order is
O(n^2) irrespective of the elements order.
I guess all other sorts somehow depend on the order of elements.
| Is This Answer Correct ? | 3 Yes | 6 No |
Post New Answer View All Answers
Can we add elements to final list?
What do you mean by selection sort?
What is height balanced tree?
What is a B tree?
Why hashtable is faster than arraylist?
What is a dequeue?
What is meant by arraylist?
What is complexity algorithm?
What will be the output of below code?
Why we use linked list?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
Define linked lists?
What is difference between list and set?
What do you mean by an Array?
What does each entry in the link list called?
