Skip to content

MrT3acher/SimpleKMP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

SimpleKMP

Simple KMP Algorithm Implementation

What Is KMP?

KMP is an algorithm for finding a pattern in a string. Its time complexity is O(n + m) that n is length of pattern and m is length of string.

How To Use SimpleKMP Class?

Simply create an object of class SimpleKMP like below:

obj = SimpleKMP([string], [pattern])

Then you can use get_temporary_array function and find like below:

get_temporary_array = obj.get_temporary_array()

found_index = obj.find()

About

Simple KMP Algorithm Implementation

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages