I am using the simple Huffman algorithm to compress and decompress a string. It takes less than a second to compress a 2mb file, but just under a minute to decompress. Is this normal, or is there a problem with my decompression logic? I can paste my code if this is not right!
EDIT: I just want to know from other peoples experience with using a Huffman algorithm if this is normal behaviour or if I have gone astray somewhere. The code doesnt break. If people say this is not normal, I can post my code and they can rip it a part and tell me what I have done wrong, otherwise, its just a waste of time.