You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: chapters/data_compression/huffman/huffman.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -66,7 +66,7 @@ This will create a codebook that looks like this:
66
66
|_o_| 1110 |
67
67
|___| 1111 |
68
68
69
-
and `bibbity bobbity` becomes `01000010010111011110111000100101110`.
69
+
and `bibbity_bobbity` becomes `01000010010111011110111000100101110`.
70
70
As mentioned this uses the minimum number of bits possible for encoding.
71
71
The fact that this algorithm is both conceptually simple and provably useful is rather extraordinary to me and is why Huffman encoding will always hold a special place in my heart.
0 commit comments