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
- 31736 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
Why we use linked list?
What are the Advantages and disadvantages of Array?
What do you mean by balance factor of a node in avl tree?
What is the difference between 1d and 2d array?
Which is the parent class of enumset class?
What is max heapify?
What is adt in data structure?
What is ascii sort order?
Is selection sort greedy?
What is java priority queue?
Tell me how to find middle element of linked list in one pass?
What are the major data structures used in the hierarchical data model?
Explain the term tail recursion?
How do you find the height of a binary tree?
Explain Stack
