/Python/Brute force string matching algorithm in python

Brute force string matching algorithm in python

1 def BF(s1,s2):
 2     """ BF algorithm """
 3     i = 0
 4     j = 0
 5     while(i < len(s1) and j < len(s2)):
 6         if(s1[i] ==  s2[j]):
 7             i += 1
 8             j += 1
 9         else:
10             i = i - j + 1
11             j = 0
12     if(j >= len(s2)):
13         return i - len(s2)
14     else:
15         return 0
16  
17 if __name__ == "__main__":
18     a1="abcaaaabbbbcccabcbabdbcsbbbbnnn"
19     a2='ccabcba'
20     b=BF(a1,a2)
21     print(b)
22     s1 = "ababcabcacbab"
23     s2 = "abcac"
24     print(BF(s1,s2))

Source: programmerall.com

Similar codes

-1 vote315 views2 answers
How do you count most frequent item in a list in python
Python
7 votes344 views5 answers
Convert categorical variable to numeric python
Python
0 vote306 views1 answer
Django less than and greater than
Python
0 vote359 views2 answers
Python read file from same directory
Python
0 vote323 views1 answer
How to connect wifi using python
Python
0 vote336 views1 answer
Ord python3
Python
2 votes302 views3 answers
Pandas show column types
Python
0 vote322 views1 answer
Newtorkx remove node
Python
0 vote333 views1 answer
Mypy clear cache
Python
1 vote326 views1 answer
Subprocess the system cannot find the file specified
Python