A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 29752 Views
- I also Faced
- E-Mail Answers
Answer Posted / manasi
The Time Complexity of Bubble sort,insertion sort and
selection sort is same i.e. O(n^2). So all sorting
algorithms will take same time to sort the elements.
Please correct me if im wrong..
| Is This Answer Correct ? | 1 Yes | 7 No |
Post New Answer View All Answers
How many types of arrays are there in visual basic?
Explain the term run-time stack?
What does adt stands for?
Define the term “percolate down”?
What is concept of data structure?
What are the difference between malloc() and calloc()?
What are scalar values?
Define graph traversals?
Which is the slowest sorting algorithm?
How do you declare A pointer to array of three chars
How can a binary tree be represented using the rotation?
What is doubly linked list?
Which sorting is best?
How much time does it take to learn data structures?
Sorting is not possible by using which of the methods?
