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
- 31922 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 |
What are different techniques for making hash function?
What is the difference between set and unordered_set?
Explain about circular linked list?
How is a hashset implemented?
Name few concurrent collection classes?
Which sorting is best and why?
How do you clear a stack?
What is binary tree used for?
Does list allow null values?
What is the top of a stack?
What is stable sort?
How do you empty an arraylist?
Windows 
