Comparative Analysis of Brute Force and Boyer Moore Algorithms in Word Suggestion Search

The development of information that continues to develop causes an explosion of information which certainly has a very complex impact on information storage management. This also impacts on companies that have several data that continues to grow every day. Therefore, there is a needs to have a search engine algorithm that can do a search system quickly with the development of information that continues to increase every day. Search engine applications or search engines in a computer system make it easy for users to find a variety of information. To facilitate its use, search engines add search features or better known as word suggestion, which in designing this application requires string matching algorithms that can be used to solve these problems. Many strings matching algorithms are available and therefore, the need for an analysis of the search algorithm to be able to help determine which search system is appropriate for use in word suggestion search. The result comparing brute force and boyer moore algorithm, it was found that as much as 79.05% showed that the Boyer Moore algorithm has a better time efficiency compared to the Brute Force.