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.
Answer:- Major property of a good hash code is that objects which are equal should return the same hash code .
Explanation: Hash codes is a numeric value which is used for identify a object while a equality testing .Hash code can occupy the value of any length and then returns a fixed length value. The value of hash codes are variable.
If two objects are equal then by the method of equal(object) if the hashcode() function is called on both the objects , they produce the same value.
Answer:
I think the answer is Writing but am not sure
