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 shortest time to execute?
- 17 Answers
- 33803 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
Which sorting does collections sort use?
When will you use array over arraylist?
Define the term “percolate down”?
How can you represent a linked list node?
How to reverse a linked list iterative algorithm?
What is an example of an algorithm?
What do you mean by breadth first search (bfs)?
Why quicksort is faster than merge sort?
Can arraylist be resized?
Is treeset synchronized?
What is linked list with example?
write a program to show the insertion and deletion of an element in an array using the position
State the rules to be followed during infix to postfix conversions?
What is time complexity of binary search?
Is array static or dynamic?
