Question

EXPLAIN BINARY SEARCH METHOD WITH AN EXAMPLE.

Answer 1

Answer:

Binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target. It is used with a list of sorted elements only. In the binary search algorithm, every pair of elements are compared.

Example : The idea of binary search is to use the information that the array is sorted.

Pls mark me as brainliest