Right, it should be "j = j + 1" and not "j + j + 1". I think that the mistake is small enough and obvious enough that the people will understand. Thanks for helping.
It's O(n). I find this video a better explanation of KMP since it goes over more examples and how to calculation the failure function in depth. ruclips.net/video/GTJr8OvyEVQ/видео.html
I watched many YT videos and still couldn't understand the algorithm. This one has the best graphical explanation. Thanks for the help!
Best f*****g video ever ! You deserve more views than those 200k videos about kmp !
I agree this is likely the best one. Hopefully it's not too hard for struggling students to find because it should clear things right up.
0:15, i sure hope there's no pee to be found in my tea
Finally found a good explanation. Thanks, dude.
Thanks a lot man. It took me a very long time to finally find this perfect explanation. :)
BEST video ever.....good simple explanation and visualization
Very clear! Thanks so much!
Nice video! Small error in line 9 of code at 3:38 , but you stated what's going on correctly :)
Right, it should be "j = j + 1" and not "j + j + 1". I think that the mistake is small enough and obvious enough that the people will understand. Thanks for helping.
I couldn’t get how did b became 2 in failure function.
Cause two characters are matching....so the prefix and suffix is 'ab'
Great, easy to understand explanation of KMP. Thanks!
I could be wrong but shouldn't your else if statement be: 'i = i + f(j-1)'?
I’m confused. Need to watch this for more times.
What is the complexity of calculating failure function table.
It's O(n). I find this video a better explanation of KMP since it goes over more examples and how to calculation the failure function in depth. ruclips.net/video/GTJr8OvyEVQ/видео.html
This is very amazing. I thank you so much for this
If you like this teaching style, check out codekits.gumroad.com/l/mariustemplate to learn fullstack web development with React!
thank you!