Perform an experimental comparison of the relative speeds of the bruteforce,
KMP, and Boyer-Moore pattern-matching algorithms. Document
the relative running times on large text documents that are then searched
using varying-length patterns.
Implement a compression and decompression scheme that is based on
Huffman coding.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here