For this week, as was the task at adaptive Huffman algorithm.
In this task, use the code that I had already used in the previous post.
The functionality is explained in the previous post, and this time add the piece of code to be something dynamic and not is adaptative.
The program compresses the text, in this occasion not enter text in the terminal, as it had done earlier in the program, the text is generated within the program, and it gives us the compressed data results.
Now the code:
Now the results:
Analysis of Results:
One problem with the program is that, when calculating the time, really does not take long to process the program, perhaps would be the size of characters produced, maybe that's the point at which this happens.