/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 vote142 views1 answer
Django ninja "schema"
Python Django
0 vote112 views1 answer
Django collectstatic with auto yes
Python
34 votes142 views6 answers
Python if in list
Python
1 vote120 views1 answer
Defaultdict key exists
Python
19 votes117 views6 answers
Python environment variable
Python
0 vote105 views1 answer
Pytorchvideo stack expects each tensor to be equal size, but got [89088] at entry 0 and [88064] at entry 1
Python
2 votes93 views1 answer
Python how to obfuscate code
Python
0 vote102 views3 answers
How to catch ctrl c in python
Python
-1 vote134 views2 answers
How do you count most frequent item in a list in python
Python
39 votes111 views6 answers
Change column name df
Python