Bug 10: String Search Boot Prefix
- This is a linear-time string search, looking for needle in haystack.
- Using an integer, it tracks all the matching needle prefixes, one bit per prefix.
- By shifting the integer high, it lengthens all the matching prefixes by one byte.
- Then it zeroes the bit for every prefix that does not match the current haystack byte.
Fix The Tiny Bug In This Go Code: