Excellent explanation! :) Please upload more videos on pattern matching algorithms like KMP, rabin Karp and finding suffix, prefix strings which will be very helpful!
Thank you so so much , if I do well in exams tomorrow it's only coz of this , sir please upload more study material like this , it'd benefit tons of students
//This one using a Library function for the same question public class a { public static void main(String args[]) { String a = "She sells shells on the sea shore"; String s = "shell"; int pos = a.indexOf(s); System.out.println(pos); } }
But in 16:56 first i=1 and b is matched, then u is also matched but g doesn't match so the while loop ends. Then i=2 and u at the position i=2 doesn't match with b so according to the algorithm we jump to i --> i+m so now i will be 8 and not 7 and at i=8 position u is present which will not match to the b of the pattern. Then how is the a option correct? Anyone please help!
That war really really great explanation!
Thank you so much
Excellent explanation! :)
Please upload more videos on pattern matching algorithms like KMP, rabin Karp and finding suffix, prefix strings which will be very helpful!
Thank you so so much , if I do well in exams tomorrow it's only coz of this , sir please upload more study material like this , it'd benefit tons of students
Thank u so much.. 😄I wish d text bks could also explain us d concept in a simple manner like dis😌
ok thank you
HI
never seen someone draw arrows as accurately by the distance of one like yuo.
thank you very much
you're much better than my doctor :')
Very beautifully explained!!!Thank u very much...expecting more videos..
Great job!
Gurugale thank you so much
please upload KMP and Boyce Moore also ...
thank you wow. You are a great teacher
//This one using a Library function for the same question
public class a
{
public static void main(String args[])
{
String a = "She sells shells on the sea shore";
String s = "shell";
int pos = a.indexOf(s);
System.out.println(pos);
}
}
you know this library function using what algorithm?
thanks a lot. u are grat teacher sir
But in 16:56 first i=1 and b is matched, then u is also matched but g doesn't match so the while loop ends. Then i=2 and u at the position i=2 doesn't match with b so according to the algorithm we jump to i --> i+m so now i will be 8 and not 7 and at i=8 position u is present which will not match to the b of the pattern. Then how is the a option correct?
Anyone please help!
well explaination!
in the 1st for loop should't the limit of i be ((n-m)+1) rather than just m-1
thanks
Thanks so much, saved my hide!