Question

explain binary search with an example​

Answer 1

Answer:

A binary number system is one of the four types of number system. In computer applications, where binary numbers are represented by only two symbols or digits, i.e. 0 (zero) and 1(one). ... For example, (101)2 is a binary number. Each digit in this system is said to be a bit.

Explanation:

plz mark it as brainlist

Answer 2

❣Answer❣

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array.

✻ ═════ •❅• ═════ ✼

Hope this will help you (◍•ᴗ•◍)