/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

0 vote226 views1 answer
Python turtle triangle
Python
0 vote244 views2 answers
Fetching data from multiple tables using related name in django
Python Django
0 vote216 views1 answer
6.2.2.4 packet tracer
Python
0 vote222 views1 answer
Red black tree python
Python
0 vote217 views1 answer
Conv2 python
Python
0 vote207 views1 answer
Python shortest distance between two points
Python
0 vote206 views1 answer
Python drop in tuple
Python
7 votes273 views3 answers
Python match case string
Python
2 votes213 views1 answer
Raise RuntimeError("populate() isn't reentrant")
Python
2 votes249 views1 answer
Covariance matrix python
Python