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
- 31899 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 is data structure and its types?
Can a tree be empty?
What is meant by ordered and sorted in collections?
Define linear probing?
What is sequential search? What is the average number of comparisons in a sequential search?
What is difference between list and array?
Differentiate between list and map.
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
How can I study data structures and algorithms?
What is difference between rb tree and avl tree?
Which sorting is used in collections sort?
What is data type and its types?
Windows 
