NewBinarySearch initializes a binary search object with its own properties initialized.

NewHashTable initializes a new hash table, with the appropriate default values.

NewLinearSearch implements the most naive approach to querying data.

BinarySearch is an implementation of the search of a (sorted) data set that has much better performance than the linear search, on average.

HashTable stores the entire dataset within Go's implementation of a hash table (a map).

LinearSearch is an implementation of "worst case" search through the data.