Part 42 - Horspool Algorithm

Horspool Algorithm
Questions answered in this video are:
1) How horspool algorithm solves string matching problem
2) How horspool algorithm is effecient than brute force string matching algorithm
3) How to construct symbol table
4) Example of string matching problem using horspool algorithm

[@dailytechinfo8125]

I understand whole topic properly 😊, thank you so much sir

[@badboy-ku6uc]

nice explanation ,Thank you sir 👏👏

[@abhinavv8532]

super clear explanation hatsoff to you sir

[@bhuvaneshwarikinagi8516]

Thankyouu soo much sir😊, the efforts u hv put to make us understand is truly appreciable 🎉👏👏

[@TanveerAhmed-ug4bn]

Wow,. Nice explanation sir 👌👌👌

[@appu_srk]

Very good and clear explanation....thank you so much

[@gray283-g3o]

nice explanation! but I think your dog is hungry

[@sui.i.i]

21th u r having exam ?

[@gray283-g3o]

@@sui.i.i yeah! im from rvitm

[@crackcet5178]

Bro all the best

[@mdafnankhaja]

wonderful explanation sir u deserve millions of subscribers

[@SHYAMN-l4f]

Thanks for explaining in a so simple way sir.........

[@manuchowda5599]

you did it great sir, please do the same for NAIVE STRING MATCHING ALGO, RABIN KARP ALGO, KMP ALGO AND BOYER MOORE ALGO

[@DrMadhusudhan_Mandya_Venkatesh]

@@manuchowda5599 Thanks yaar.....sure i will do all these topics in due time.

[@kushalkush6007]

Great detailed explanation 👏💯

[@ranjinis-b7q]

Thank you so much sir 😊

[@MamathaMahantesh]

Clear explanation

[@Ullas-Gaming89]

clear explaination👌👌

[@dhanalaxmim7124]

Super...Thank you so much sir.

[@shariqafatima5778]

Nice explanation sir😊

[@salim2834]

sir ❤❤

[@vinaykumar-gk3yv]

sir why not r is 0 because it came first

[@DrMadhusudhan_Mandya_Venkatesh]

Thanks for your question..................we are not considering the last character.(so not R in this example). Always, we are finding the distance of any character with respect to last character only.

[@shubhashree163]

👏🏻

[@sharmilaa623]

Sir what is the efficiency of horspool algorithm

[@DrMadhusudhan_Mandya_Venkatesh]

Thank you for the good question. Here, time complexity depends on 2 tasks. Task1: Preprocessing stage, that means, time taken to construct the shift table. For this, at the worst case it takes, O(m). where m is the pattern length. Task2: Searching stage. at the worst case, it will take O(m * n ). where n is the text size at the avergae case, it will take n time at the best case, it will take n/m time

[@sharmilaa623]

@@DrMadhusudhan_Mandya_Venkatesh tq so much sir good way of explaining

[@Vtunotes]

woahhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!