A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 27792 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
How do you find the complexity of a bubble sort?
Define terminal nodes in a tree?
Explain quick sort?
Does arraylist have index?
What is a stable algorithm?
Is list a data type?
What is scalar example?
Define heap?
What is the purpose of sorting?
what is the difference between Linear Array and Linked List?
What is the difference between a push and a pop?
Can the double-checked locking fail on a single processor system?
Windows 
