Тёмный

Knuth-Morris-Pratt - Pattern Matching 

Code Kits
Подписаться 1,5 тыс.
Просмотров 22 тыс.
50% 1

Опубликовано:

 

16 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 20   
@Shubh22
@Shubh22 5 лет назад
I watched many YT videos and still couldn't understand the algorithm. This one has the best graphical explanation. Thanks for the help!
@Mussi813
@Mussi813 7 лет назад
Best f*****g video ever ! You deserve more views than those 200k videos about kmp !
@codekits7759
@codekits7759 7 лет назад
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.
@FedericoCoppolaIT
@FedericoCoppolaIT 3 года назад
Very clear! Thanks so much!
@hasikadilshani278
@hasikadilshani278 5 лет назад
BEST video ever.....good simple explanation and visualization
@rohithravindran3438
@rohithravindran3438 6 лет назад
Thanks a lot man. It took me a very long time to finally find this perfect explanation. :)
@martindimitrov8547
@martindimitrov8547 6 лет назад
Finally found a good explanation. Thanks, dude.
@codekits7759
@codekits7759 4 года назад
If you like this teaching style, check out codekits.gumroad.com/l/mariustemplate to learn fullstack web development with React!
@erik9334
@erik9334 4 года назад
0:15, i sure hope there's no pee to be found in my tea
@MichaelKainola
@MichaelKainola 6 лет назад
Great, easy to understand explanation of KMP. Thanks!
@10000555K
@10000555K 5 лет назад
I could be wrong but shouldn't your else if statement be: 'i = i + f(j-1)'?
@ronaldabellano5643
@ronaldabellano5643 5 лет назад
I couldn’t get how did b became 2 in failure function.
@crisis007yt8
@crisis007yt8 5 лет назад
Cause two characters are matching....so the prefix and suffix is 'ab'
@fahrankamili7931
@fahrankamili7931 7 лет назад
This is very amazing. I thank you so much for this
@rplusgdj
@rplusgdj 6 лет назад
What is the complexity of calculating failure function table.
@whattehjeff
@whattehjeff 6 лет назад
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. ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-GTJr8OvyEVQ.html
@InquiringJoe
@InquiringJoe 7 лет назад
Nice video! Small error in line 9 of code at 3:38 , but you stated what's going on correctly :)
@codekits7759
@codekits7759 7 лет назад
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.
@ronaldabellano5643
@ronaldabellano5643 5 лет назад
I’m confused. Need to watch this for more times.
@kunalbiswas1267
@kunalbiswas1267 6 лет назад
thank you!
Далее
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
18:56
ОТПРАВЬ СВОЕЙ ЛП/ЛД
00:10
Просмотров 205 тыс.
Knuth-Morris-Pratt algorithm
10:00
Просмотров 151 тыс.
ADS1: Boyer-Moore basics
8:50
Просмотров 256 тыс.
ADS1: Boyer-Moore: putting it all together
6:17
Просмотров 91 тыс.
Boyer-Moore - Pattern Matching
11:48
Просмотров 59 тыс.
9.2 Rabin-Karp String Matching Algorithm
23:50
Просмотров 792 тыс.
Boyer-Moore Substring Search - Part 2
6:41
Просмотров 39 тыс.
Knuth-Morris-Pratt Algorithm for String Matching
8:23
ОТПРАВЬ СВОЕЙ ЛП/ЛД
00:10
Просмотров 205 тыс.