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
- 31821 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
Define a right-skewed binary tree?
What are dynamic data structures?
What is list and types of list?
How to pass in data structure exam?
What do you mean by linear probing?
Which time complexity is best?
Which is best book for data structures?
Define static data structures?
Write a program to reverse a single linked list.
What are the different types of data structures?
Mention the steps to insert data at the starting of a singly linked list?
Can arraylist be empty?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
How do you balance a tree?
What is the height of binary tree?
