diff options
| author | akiyamn | 2021-03-23 13:55:14 +1100 |
|---|---|---|
| committer | akiyamn | 2021-03-23 13:55:14 +1100 |
| commit | a7d2f9a2cbaf5b4fc2135a37d80481105359c867 (patch) | |
| tree | 0d525ee45782e73bb2537cd424ff839295abe4cc /ass1/binary_boyermoore.py | |
| parent | 0dfa5353c274deb9aa455475965cf060e8ce4bd9 (diff) | |
| download | fit3155-a7d2f9a2cbaf5b4fc2135a37d80481105359c867.tar.gz fit3155-a7d2f9a2cbaf5b4fc2135a37d80481105359c867.zip | |
Boyer-Moore bad char rule
Diffstat (limited to 'ass1/binary_boyermoore.py')
| -rw-r--r-- | ass1/binary_boyermoore.py | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/ass1/binary_boyermoore.py b/ass1/binary_boyermoore.py new file mode 100644 index 0000000..1d60f52 --- /dev/null +++ b/ass1/binary_boyermoore.py @@ -0,0 +1,27 @@ +txt = "xpbctbxabacbxtbpqa" +pat = "tbapxab" +m = len(pat) +n = len(txt) +R = [m for _ in range(0, 26)] + +def alpha_number(char): + return ord(char) - 97 + +for i in range(m): + R[alpha_number(pat[i])] = i + +j = 0 +while j < n-m: + for i in range(m-1, -1, -1): + print(j) + match = pat[i] == txt[j+i] + if match: + pass + # print(i) + else: + mismatched = txt[j+i] + shift = i-R[alpha_number(mismatched)] + j += max(1, shift) + if j > n-m: + break +print(R)
\ No newline at end of file |
