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
- 31418 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 the disadvantages of representing a stack or queue by a linked list?
Does linked list allow duplicates?
Does concurrenthashmap allow null?
How does a hashmap work?
What is binary tree? Explain its uses.
Define non linear data structure.
Is python good for freshers?
Why is hashing used?
Write a program to sum values of given array.
Differentiate between list and map.
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
Why is hashmap faster than arraylist?
Windows 
