We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Hello,
I agree with you that is not going to dramatically improve the performance; but I think are goal is to always try to find the better solutions and even nanosecods matter.
Also is just one more line.
I ran some test and it actually helps the performace a little.
Tree: Huffman Decoding
You are viewing a single comment's thread. Return to all comments →
Hello, I agree with you that is not going to dramatically improve the performance; but I think are goal is to always try to find the better solutions and even nanosecods matter. Also is just one more line. I ran some test and it actually helps the performace a little.
******This is the code ************
****RESULTS USING TERMINAL********
Test 1:
Declaring Size: 5480 nano Seconds
Using Length() method: 9196 nano Seconds
Test 2:
Declaring Size: 5021 nano Seconds
Using Length() method: 6803 nano Seconds
Test 3:
Declaring Size: 5144 nano Seconds
Using Length() method: 6887 nano Seconds