Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.
(a) True
(b) False
The question was asked in examination.
This intriguing question comes from Insertion sort topic in chapter Sorting of Data Structures & Algorithms II