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
- 32281 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's the difference between a hashtable and a hashmap?
Why do we need to use computers to help us sort lists?
Which sorting is best and why?
Describe tree database.
What are the parts of a linked list?
Why is quicksort faster than merge sort?
State the demerit of linear representation of binary trees?
What do you know about traversal in linked lists?
What is stable sort example?
What is ascending and descending order?
How many types of priority queue are there?
What do you mean by heap order property?
Windows 
