Implement the Boyer Moore algorithm from scratch. Test it and plot c against n and m where n is the size of the text and m is the size of the pattern, for different values of n and m.
Implement the Z algorithm from scratch. Test it and plot c against n and m where n is the size of the text and m is the size of the pattern, for different values of n and m.
![1.<br>import random<br>def getRandom(x,y):<br>tmp=(x + random.randint(0,100000) % (y-x+1))<br>return tmp<br>def randomizedBinarySearch(arr,1,r,x) :<br>if r>=1:<br>mid=getRandom(1,r)<br>if arr[mid]<br>== X:<br>return mid<br>if arr[mid]>x:<br>return randomizedBinarySearch(arr, 1, mid-1, x)<br>return randomizedBinarySearch(arr, mid+1,r, x)<br>return -1<br>if<br>name<br>main_':<br>==<br>[2, 3, 4, 10, 40]<br>arr =<br>n=len(arr)<br>x=10<br>result = randomizedBinarySearch(arr, 0, n-1, x)<br>if result==-1:<br>print('Element is not present in array')<br>else:<br>print('Element is present at index ', result)<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_uvwjxp0-ezu2n2nw.png)
Extracted text: 1. import random def getRandom(x,y): tmp=(x + random.randint(0,100000) % (y-x+1)) return tmp def randomizedBinarySearch(arr,1,r,x) : if r>=1: mid=getRandom(1,r) if arr[mid] == X: return mid if arr[mid]>x: return randomizedBinarySearch(arr, 1, mid-1, x) return randomizedBinarySearch(arr, mid+1,r, x) return -1 if name main_': == [2, 3, 4, 10, 40] arr = n=len(arr) x=10 result = randomizedBinarySearch(arr, 0, n-1, x) if result==-1: print('Element is not present in array') else: print('Element is present at index ', result)
![2.<br>def KMPSearch(pat, txt):<br>M = len(pat)<br>N = len(txt)<br>1ps = [0]*M<br>j = 0 # index for pat[]<br>%3D<br>computelPSArray(pat, M, 1ps)<br>i = 0 # index for txt[]<br>while i < N:<br>if pat[j]<br>txt[i]:<br>==<br>i += 1<br>j += 1<br>if j<br>== M:<br>print (](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_hv0jxp0-3zroi3v5.png)
Extracted text: 2. def KMPSearch(pat, txt): M = len(pat) N = len(txt) 1ps = [0]*M j = 0 # index for pat[] %3D computelPSArray(pat, M, 1ps) i = 0 # index for txt[] while i < n:="" if="" pat[j]="" txt[i]:="=" i="" +="1" j="" +="1" if="" j="=" m:="" print="" ("found="" pattern="" at="" index="" "="" +="" str(i-j))="" j="1ps[j-1]" elif="" i="">< n and pat[j] != txt[i]: if j != 0: j = lps[j-1] %3d else: i += 1 n="" and="" pat[j]="" !="txt[i]:" if="" j="" !="0:" j="lps[j-1]" %3d="" else:="" i="" +="">