Computer Science, asked by VarshaBaghel, 1 year ago

what is binary search with example

Answers

Answered by Anonymous
1
In mathematics and digital electronics, a binary number is a number expressed in the base-2 numeral system or binary numeral system, which uses only two symbols: typically 0 and 1
......
@@ @@ @@
Please mark the answer as brain list answer to

VarshaBaghel: binary search
vinisoni: 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.
VarshaBaghel: ty
vinisoni: wlcm
Answered by Remit5
1
Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

Example:


Similar questions