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
- 32236 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
State the demerits of linked representation of binary trees?
What actions are performed when a function returns?
How do arrays work?
How arraylist increase its size?
Is array a data type?
State the rules to be followed during infix to prefix conversions?
How can you correct these errors?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Is unordered_map a hash table?
how to add an item to the beginning of the list?
How are the elements of a 2d array are stored in the memory?
Explain what is the data structures used to perform recursion?
How do we search a specific element in an array?
What are the different types of data structures explain briefly?
What are the applications of linked list?
