MCQOPTIONS
Saved Bookmarks
| 1. |
Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for introsort implementation? |
| A. | Because insertion sort is faster and adaptive |
| B. | Because insertion sort requires less space |
| C. | Because insertion sort is easy to implement |
| D. | Because insertion sort is easy to understand |
| Answer» B. Because insertion sort requires less space | |