@thesis{thesis,
		author={PRANA  PANGESTU},
		title ={WORD SEARCH USING BOYER-MOORE
ALGORITHM},
		year={2018},
		url={http://repository.unika.ac.id/16111/},
		abstract={ABSTRACT
Boyer-Moore is one of the algorithms used for the search words. Boyer-
Moore algorithm is said to be one of the fastest to complete the search process
said. This project aims at examining the algorithm Boyer-Moore will be coupled
with a Hash Table data structure.
This project will implement boyer-moore algorithm with difference data
structure hash table and will be compare between native boyer-moore and
sequential search. To know whether hash table is affect to make search word more
be faster
The end result of this program is a program that is used to compare
between the Boyer-Moore Hash Table, Boyer-Moore and Sequential Search.
Keyword: boyer-moore, hash table, string searching, searching, sequential
search algorithm
iv}
		}