/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 vote157 views1 answer
Load a Dictionary from File in Python Using the Load Function of the pickle Module
Python
0 vote141 views1 answer
Sklearn model persistence
Python
0 vote148 views1 answer
Python async partial function
Python
1 vote189 views1 answer
Python groupby sum single columns
Python
1 vote145 views2 answers
Python list equality
Python
2 votes167 views1 answer
Python gui drag and drop
Python
-3 votes136 views1 answer
Plot time series python
Python
0 vote129 views1 answer
Change column row box colour tkinter
Python
22 votes158 views8 answers
Math
Python
0 vote145 views1 answer
Binary to decimal in Python without inbuilt function
Python