fix(huffman): revert frequencies to original in CLRS

README.md

@@ -66,7 +66,7 @@ Some real-world usage of the algorithms to show when they can be applied.
 
 A classic application of this problem is in scheduling a room for multiple competing events, each having its own time requirements (start and end time), and many more arise within the framework of operations research. [Source](https://en.wikipedia.org/wiki/Activity_selection_problem)
 
-### Huffman coding
+### Huffman coding 🔡
 
 > A Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression.
 

algorithms/misc/huffman/__snapshots__/huffman.spec.ts.snap

@@ -3,9 +3,9 @@
 exports[`Huffman coding tree 1`] = `
 │           ┌── d:16
 │       ┌── 30
-│       │   │   ┌── f:8
+│       │   │   ┌── e:9
 │       │   └── 14
-│       │       └── e:6
+│       │       └── f:5
 │   ┌── 55
 │   │   │   ┌── b:13
 │   │   └── 25

algorithms/misc/huffman/huffman.spec.ts

@@ -8,8 +8,8 @@ describe('huffman', () => {
       { char: 'b', frequency: 13 },
       { char: 'c', frequency: 12 },
       { char: 'd', frequency: 16 },
-      { char: 'e', frequency: 6 },
-      { char: 'f', frequency: 8 },
+      { char: 'e', frequency: 9 },
+      { char: 'f', frequency: 5 },
     ];
     const tree = huffman(frequences);