99% of learning happens when one adjusts their actions according to feedback. When this airway is blocked, situation can hardly ever improve. And the biggest reason for evading and resisting investigating and learning from errors, is a tendency to take it personally.
As opposed to “take it systematically”.
A couple of days ago, the creator of the most popular torrent sharing site, KickassTorrent, was arrested in Poland, and as of now US is seeking his extradition. After isoHunt’s shut down in Canada, 2013, ThePirateBay’s end in Sweden, 2014… now this. Again.
Due to patent issues with newer schemes [1], Huffman Coding remains to be the go-to compression algorithm of the day, being applied in ZIP, JPEG, PNG… and much more.
The core idea of Huffman Coding, is to use shorter codes to represent more frequent characters. As for why we always see a mysterious tree of zeros and ones, well, that’s essentially how computers store anything: with binary codes. Essentially the goal of constructing the Huffman binary tree is: to assign the most frequent characters to the shortest zero/one path, walking from tree root to end of a branch.
How to create such a tree?