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
- 31871 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
What is an example of an algorithm?
What is peep stack?
Explain what is B-tree?
Can we use Generics with the array?
What is the similarity between a Structure, Union and enumeration?
Advanced problems related to Data Structures were asked
What is the need for priority queue?
How efficient is bubble sort?
What is homogeneous array?
What is doubly linked list?
Why is quicksort better than mergesort?
Which algorithm is used in collections sort method?
What exactly is data?
What is m way tree in data structure?
Differentiate between arraylist and vector.
