A linear time string preprocessing algorithm in JavaScript. Can be used for linear or even sub-linear time pattern matching if used with other algorithms (such as Boyer-Moore with Galil's optimisation)
-
Updated
Dec 17, 2022 - JavaScript
A linear time string preprocessing algorithm in JavaScript. Can be used for linear or even sub-linear time pattern matching if used with other algorithms (such as Boyer-Moore with Galil's optimisation)
Add a description, image, and links to the time-comp topic page so that developers can more easily learn about it.
To associate your repository with the time-comp topic, visit your repo's landing page and select "manage topics."