This search compares the target value with the middle element in the collection, then ignores the half of the collection in which the target cannot exist a) Linear b) Exponential c) Interpolation d) Binary

Question

Avery

Engineering

31 October, 11:03

This search compares the target value with the middle element in the collection, then ignores the half of the collection in which the target cannot exist a) Linear b) Exponential c) Interpolation d) Binary

+2

Answers (1)

Know the Answer?

Isla Woodward · Answer 1

d) Binary

Explanation:

Binary search is a search algorithm that finds the position of a value in an ordered array. It compares the value with the element in the middle of the array, if they are not equal, half in which the value cannot be eliminated and the search continues in the remaining half until the value is found.