Huffman Coding (Conceptual)
Channel:
Subscribers:
2,650
Published on ● Video Link: https://www.youtube.com/watch?v=h-jQhXoZVEo
Today we didn't look at any code, just went over character encodings and how Huffman coding can be used to compress down the number of bits needed to encode a letter fairly significantly.
This is a great example of how you can use multiple data structures together to solve interesting problems.
Other Videos By Bill Kerney
2024-05-01 | C++: Dear ImGUI in 5 Minutes (+25 minutes of discussion) |
2024-05-01 | Making a Thread Safe version of a data structure |
2024-04-26 | C++ Multithreading Part 2: Mutexes and Lock_Guard |
2024-04-26 | RPG42: Project Guidelines |
2024-04-25 | C++ Multithreading: OpenMP, Atomics, Threads |
2024-04-22 | C++ Error Handling: Exceptions |
2024-04-22 | Unix and Vim Quiz #3 |
2024-04-19 | Vim Macros |
2024-04-19 | C++ Bitwise Part 2 |
2024-04-17 | C++ Bitwise |
2024-04-15 | Huffman Coding (Conceptual) |
2024-04-12 | Tries, and inspiring words |
2024-04-10 | C++: Hash Tables |
2024-04-08 | Heaps / Array Representation of Trees |
2024-04-03 | Intro to Rust for C++ People |
2024-04-01 | Memory Allocation Review and Pointer Tricks |
2024-04-01 | Big O Review |
2024-04-01 | C++: The Nameless (Classes, Lamdas, Variables) |
2024-03-18 | College Path Lecture (Class Offerings and Transfer Possibilities) |
2024-03-18 | Recursion |
2024-03-15 | RPG-41 Overview |