Boyer-Moore is one of the algorithms used for the search words that is said to be one of the fastest to complete the search process. This project aims to implement hash table and see the effect it has in the searching process. A hash table is a table that contains key that maps to a value using a hash function. By doing so, the hash table should improve the speed of searching process. The vanilla version of Boyer-Moore will be used as the baseline to test the speed and accuracy of this method and check whether further improvement are needed.