Open AccessComparison criteria between matching algorithms texts application on (horspool's and brute force algorithms)
Author(s) -
A. M. Ibrahim,
Mustafa Elgili Mustafa
Publication year - 2015
Publication title -
journal of advanced computer science and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-4332
DOI - 10.14419/jacst.v4i1.4283
Subject(s) - brute force , algorithm , computer science , matching (statistics) , string searching algorithm , spelling , subject (documents) , field (mathematics) , search algorithm , pattern matching , artificial intelligence , mathematics , statistics , world wide web , linguistics , philosophy , computer security , pure mathematics
The subject of matching text or search the texts is important topics in the field of computer science and is used in many programs such as Microsoft word program in correct spelling mistakes and search &replace, and other uses. The aim of this study was to learn how to trade-off texts matching algorithms, which are very much where we have the application on Horspool's and Brute Force algorithms. According to the standard number of comparisons and time of execution. The study pointed on preference Horspool's algorithm.