- findSubstring.html - has a function which checks the presence of a substring inside a string. It's a simple algorithm with time complexity - О( string.length * substring.length)
- findSubstringHash.html - uses Rabin–Karp algorithm (it uses hash function)
- findSubstringKMP.html - uses Knuth–Morris–Pratt algorithm. Prefix function helps to make a better time complexity - O(string.length + substring.length)
- Zfunction.html - has two realisations of Z function
- findSubstrBoyer_Moore.html is a realisation of Boyer–Moore Algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
unoms/string-algorithms-JS
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms of finding a substring in a string
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published