Simple and unoptimized Huffman coding
This C++11 implementation of Huffman coding is used for demonstration and educational purposes, no major optimizations were introduced.
It is quite slow, but still can be used for practical projects.
Algorithm compresses text almost in half like a typical Huffman coder.
Use CMake.
Compiled and tested on Windows 10 with CMake 3.27.0, MinGW 13.1.0, Visual Studio 17 2022.
The ISC License
Copyright (c) 2023-2025, Dmitry Sirachenko
Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.