A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 31113 Views
- I also Faced
- E-Mail Answers
Answer Posted / gautam
heap sort is the correct answer because it requires log(n)
time where n is the number of nodes
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
Advanced problems related to Data Structures were asked
What is sorting in math?
Is radix sort faster than quicksort?
Which sorting method is slowest?
What is an example of an array?
What is the best case complexity of bubble sort?
What are the topics in data structures?
What is the advantage of circular linked list?
Describe queue operation.
Explain what is B-tree?
What is collections singletonlist?
What are linked lists good for?
What are the advantages of array?
State the difference between arrays and linked lists?
What is significance of ” * ” ?
