+1 vote
in Data Structures & Algorithms II by (110k points)
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

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Right answer is (a) True

Easy explanation - Binary search can be used in an insertion sort algorithm to reduce the number of comparisons. This is called a Binary insertion sort.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...