KMP Algorithm | Searching for Patterns | GeeksforGeeks

KMP Algorithm | Searching for Patterns | GeeksforGeeks

GeeksforGeeks

6 лет назад

257,992 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

Ammar Aakel
Ammar Aakel - 11.05.2023 20:10

Music is really bad

Ответить
karamjeetmca
karamjeetmca - 12.03.2023 15:39

Content is good. Pls add the audio in this vedio

Ответить
Jatin Bhardwaj
Jatin Bhardwaj - 11.09.2022 21:03

Provide Solution Of HackerEarth Coding Questions For Assessments In Java If You Read This Comment Then Ping Me On My Email ID By Today.

Ответить
DHARAM SINGH
DHARAM SINGH - 08.05.2022 14:37

You should also add voice explainiation, that would make it easier to understand.

Ответить
Mac Unknown
Mac Unknown - 28.01.2022 21:59

Geeksforgeeks amazing content as always. We just want some edge cases examples where you iterated over the whole algorithm with each step put down in proper.

Ответить
Ghanshyam Patil
Ghanshyam Patil - 14.05.2021 20:16

Voice not there but till very good video.

Ответить
高金生Christian Deantana
高金生Christian Deantana - 16.04.2021 18:37

can we print -1 if there's no match?

Ответить
C Joe
C Joe - 15.04.2021 01:47

The Video does not cover the conditional branch when Len is not 0 and the string at I and at Len does not match. This is the part I do not understand.

Ответить
Vishal Patil
Vishal Patil - 12.09.2020 07:22

Log2base2 is one of the worst thing don't take part into it anyone. My money was waste for that

Ответить
laraib anwar
laraib anwar - 29.08.2020 14:02

Well explained gfg.. Keep it up

Ответить
Surya Teja Chavali
Surya Teja Chavali - 10.08.2020 22:40

Voice over by someone would have been better...

Ответить
Mayank Upadhyay
Mayank Upadhyay - 09.07.2020 10:27

The best video, I have found so far.

The animation of sliding the pattern against txt string gave a new perspective to understand it.

Thankyou very much!

Ответить
Liang Jie Ng
Liang Jie Ng - 02.07.2020 04:11

A very detail explanation. It is hard to understand by just reading text

Ответить
Dropfire Music
Dropfire Music - 23.05.2020 23:19

Thank you so much for your hard work!

Ответить
Dima Gorbenko
Dima Gorbenko - 29.04.2020 06:34

This algorithm doesn't look like the same which is described on the corresponding wikipedia article, which is more efficient. This is not KMP, it's some variation.

Ответить
Indo Yoon
Indo Yoon - 16.04.2020 09:54

Yet the example is simple but is the best for understanding the algorithm.

Ответить
Sudhanva Hebbar
Sudhanva Hebbar - 12.04.2020 14:30

Instead of background music if there was a voice explaining it we would have understood it better.

Ответить
Lei Shen
Lei Shen - 23.02.2020 10:54

Very clear. I wish you could create a clip for BM algorithm like this.

Ответить
zoetL1
zoetL1 - 29.01.2020 18:53

Good explanation but as other people mentioned, more examples would be helpful as well as edge cases

Ответить
Harsh Seth
Harsh Seth - 06.01.2020 18:59

I am just amazed with the algorithm K-M created.

Ответить