Vidyalelo
Data Structure · Q43

Sorting Algorithms

Programming · Data Structure · question 43

Q43

In which scenario does the Heap Sort algorithm perform best?

A.
When the data is partially sorted.
B.
When the data is sorted in reverse.
C.
When the data is unsorted.
Answer
D.
When the data is very small.

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board