Answer:
<u> A. It uses binary numbers in its algorithm</u>
Explanation:
A Binary search is a type of algorithm designed to look through <em>only </em>a sorted array of data for a particular item.
It is<em> more efficient (faster) </em>than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.
A already assigned variable cannot be assigned twice You can make the variable change over to a new one or call a whole new one to assign one without a value or It might be possible to do v=n (v is variable and n is number / value)
