A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 27769 Views
- I also Faced
- E-Mail Answers
Answer Posted / rahul
Bubble Sort cannot be the answer, Because the MODIFIED BUBBLE SORT takes complexity of O(n) when the elements are arranged in a particular order..
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
How does selection sort work?
How does quick sort work?
How can we delete any specific node from the linked list?
Can value be null in treemap?
Define a relation?
What does arraylist remove do?
When is a binary search algorithm best applied?
What are linked list?
What is the difference between an array and vector?
What are the disadvantages of linked list?
What is a bubble sort and how do you perform it?
Will it create any problem if we add elements with key as user defined object into the treemap?
Write the algorithm for converting infix expression to postfix expression?
Define an abstract data type (adt)?
Why linked list is required?
