I am doing compression using Huffman .
I have a string of length around 1500000. The string consists of 1s and 0s only.
I have a linked list consisting of Huffman code table of a symbol and a short binary string representing the symbol.
This is what I do
Loop through longer length string
Loop through linked list
compared if substring of longer length string == string from linked list
However, this operation takes around 20min to complete which is way too long to decompress a data.
Is there a faster way of decompressing algorithm using the same huffman coding?
Thanks a lot