A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 27802 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
What is stack in geography?
Define an algorithm.
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
How expression trees are gets represented in data structure?
Run time memory allocation is known as in data structure?
Define a priority queue?
Describe what is Node in link list? And name the types of Linked Lists?
How do you find the length of an arraylist?
How many types of linked lists are there?
What is linked list with example?
What member function places a new node at the end of the linked list?
How do you find the second largest element in an array of integers?
What is circular queue example?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Is array a dynamic data structure?
