A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
- 12 Answers
- 29452 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 the average number of comparisons in a sequential search?
Name few collections map implementations?
Can nsarray contain nil?
Does arraylist allow null values?
What is heap tree?
What is application of data structure?
Is array static or dynamic?
Describe the merge sort principle and what will be its time complexity?
Is an arraylist an object?
How to find if linked list has loop?
How do treesets work internally?
What type of data structure is used to perform recursion?
Windows 
