MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Why is heap sort preferred over merge sort for introsort implementation? |
| 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 |
| Answer» C. Because heap sort is easy to implement | |