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
- 34211 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
What is complexity algorithm?
What are common data structures?
What is sorting problem?
Define in brief an array.
Why do we need to recycle?
How do you assign an address to an element of a pointer array ?
How does insertion sort works?
Mention for which header list, you will found the last node contains the null pointer?
How many sorting techniques are there?
Can treemap have duplicate values?
Why is selection sort used?
Define an abstract data type (adt)?
Why is hashset not ordered?
Tell me about the different sorting techniques.
What is a tech stack?
