A review: search visualization with Knuth Morris Pratt algorithm

1st Nommensen International Conference on Technology and Engineering

Rahim, Robbi^1,2 ; Zulkarnain, Iskandar^3 ; Jaya, Hendra^4

Universiti Malaysia Perlis, Universiti Malaysia, Perlis, Malaysia^1

Department of Health Information, Akademi Perekam Medik Dan Infokes Imelda, Jl. Bilal Ujung, Medan

20116, Indonesia^2

Department of ComputerSystem, STMIK Triguna Dharma, Jl. Jenderal Abdul Haris Nasution No.73, Medan

20219, Indonesia^3

Department of Computer Engineering, STMIK Triguna Dharma, Jl. Jenderal Abdul Haris Nasution No.73, Medan

20219, Indonesia^4

关键词: Algorithm selection;    Search process;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/237/1/012026/pdf
DOI  :  10.1088/1757-899X/237/1/012026

来源: IOP

【 摘 要 】

In this research modeled a search process of the Knuth-Morris-Pratt algorithm in the form of easy-To-understand visualization, Knuth-Morris-Pratt algorithm selection because this algorithm is easy to learn and easy to implement into many programming languages.