/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

6 votes167 views6 answers
Tuple methods in python
Python
0 vote158 views1 answer
Python conjugate
Python
0 vote150 views2 answers
Composition in python
Python
10 votes176 views6 answers
Pandas if else
Python
1 vote168 views1 answer
How to kill tkinter
Python
3 votes173 views1 answer
Python csv reader set delimiter
Python
0 vote157 views1 answer
Aggregate the elements of each partition, and then the results for all the partitions
Python
0 vote148 views1 answer
Grapper
Python
0 vote146 views1 answer
Python return min length of list
Python
0 vote156 views1 answer
Quoto x discord selfbot
Python