PERBANDINGAN ALGORITMA HORSPOOL DAN ALGORITMA ZHU-TAKAOKA DALAM PENCARIAN STRING BERBASIS DESKTOP
Abstrak: String searching is
the search process by using the index to find text that can help in information
retrieval systems. Continuing previous research, this study uses an algorithm
Horspool and Zhu-Takaoka to find the performance of each of these algorithms in
the search for a pattern in the text. So they make a useful desktop-based
application to measure performance of both algorithm, particulary the time
required to perform string searching
process. Using the method of prototyping and Microsoft Visual Studio with
C# programming language implementation. Result obtained from this application
is the number of words found, and the processing time of each algorithm. From
this study, the Horspool algorithm is 19,82845 percent faster in first test
with the pattern "swan" in a text file 50 multiples 1000 words and
15.9442 percent in the second trial using text files 70000 words with different
pattern than the number of characters Zhu algorithm -Takaoka in the process of
searching string.
Index Terms: String searching,
Horspool, Zhu-Takaoka, Microsoft Visual Studio, application, processing time
Penulis: Adhi Kusnadi, Abraham
Khrisnandi Wicaksono
Kode Jurnal: jptkomputerdd170294