Address Book (Dictionary ADT) with Hashing

This code is an example implementation of the standard Dictionary ADT. It is implemented as an Address book that uses hashing(instead of a basic sequential search) so that add, search, and delete should run with a Big-O value of O(1) or at least close to it!