Q195
Why is heap sort preferred over merge sort for introsort implementation?
A.
Because heap sort is faster
B.
Because heap sort requires less space
AnswerC.
Because heap sort is easy to implement
D.
Because heap sort is easy to understand
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board