You have chosen to sponsor your bid up to a maximum amount of .
looking for someone who is able to implement in the easiest way one of the following text algorithms:
- Karpin Rabin
- Knuth Morris
- Knuth Morris-Pratt
in C++. The actual task is to write the program which be an implementation on one of those PLUS it will have to meet some other standards.
For instance, it should pass time complexity tests, time complexity is given in the task. I am not really aware of what other tests are responsible for, hopefully they check only the correctness of time complexity.
But at most, I would love to work with someone who could write implementation in possibly the most simple way, as I am novice when it comes to C++ language. My budget isn't the big one, so if you are some top coder with money expectations, don't think this job is suitable for you.