Select the correct answerBinary search can be used in an insertion sort algorithm to reduce the number of comparisons.OptionsTrueFalse

Sorting algorithms can be compared based on the number of comparison statements they make.Group of answer choicesTrueFalse

The search algorithm that gives an overall time complexity of O(log i) + O(log n) isGroup of answer choicesBinary SearchExponential SearchTernary SearchJump Search

Which of the following algorithms does not need sorting of elements before performing a search?Group of answer choicesExponential SearchSequential SearchBinary SearchJump Search

A hash table is always faster than a binary search tree for searching elements.Group of answer choicesTrueFals

Which of the following sorting algorithms is not a comparison-based algorithm?Group of answer choicesInsertion sortQuick SortBubble SortRadix Sort