
txt -> length N (string s) pat -> length M (pattern) N>=M //To calculate hash from previous hash // hash( txt[s+1 .. s+m] ) = ( d ( hash( txt[s .. s+m-1]) – txt[s]*h ) + txt[s + m] ) mod q // hash( txt[s .. s+m-1] ) : Hash value at sh...
Engineer and Programmer
An engineer pursuing B.Tech from IIT Gandhinagar and interested in Finance, Logic, Mathematics, machine learning, artificial intelligence, computer networks, data structures and algorithms and programming.
Markdown supported · ⌘↵ to post
No responses yet.