Hardware and Software Design Question:

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.

Hashing provides a fast way to search a large, unsorted data set at the cost of extra memory. It is described as "directly referencing records in a table by doing arithmetic transformations on keys into table addresses."