Why is heap sort preferred over merge sort for introsort implementation?
Posted: Wed Jul 13, 2022 6:15 pm
a) Because heap sort is faster
b) Because heap sort requires less space
c) Because heap sort is easy to implement
d) Because heap sort is easy to understand
b) Because heap sort requires less space
c) Because heap sort is easy to implement
d) Because heap sort is easy to understand