Compressing text using Huffman trees worked example

  Рет қаралды 33,589

Mr Dimmick's Computing Channel

Mr Dimmick's Computing Channel

3 жыл бұрын

Leran how to compress a string of text by using Huffman encoding, including constructing a tree from scratch and using it to encode and decode a compressed binary representation of a message.

Пікірлер: 30
@tmanley1985
@tmanley1985 Ай бұрын
I have no idea why but I always prefer just good old pencil and paper (in this case a sharpie) demonstration. I don't need a bunch of effects for something like this. And it feels like someone's right there with you showing you something cool.
@Myheart19608
@Myheart19608 3 ай бұрын
simply the easiest explanation on huffman coding..Thank you sir
@SachinBhatnagar
@SachinBhatnagar 6 ай бұрын
Absolutely the finest example of the Huffman encoding algorithm!
@animaltrainer88
@animaltrainer88 Жыл бұрын
Best video on the YT on huffman. Hats off to you sir.
@ELIVATESSENCE
@ELIVATESSENCE 6 ай бұрын
Thankyou Sir, I am a computer engineering student. Your videos are very valuable for us
@Korzakapitany
@Korzakapitany 10 ай бұрын
Fantastic ! Thank you, Sir !
@SergeyIvanov1337
@SergeyIvanov1337 Жыл бұрын
most correct huffman tutorial on youtube
@metemertb
@metemertb 2 жыл бұрын
You helped a lot thanks sir.
@mikhailwebb8377
@mikhailwebb8377 6 ай бұрын
This really helped. Thanks.
@cielolov2356
@cielolov2356 25 күн бұрын
So much thank you, so clear !!
@WassupCarlton
@WassupCarlton 2 ай бұрын
very crispy and direct walkthrough, thank you Mr. D. A note of caution for future productions though: your |s and |s look identical. (See what I did there?)
@magnusolsnes9155
@magnusolsnes9155 6 ай бұрын
Thanks ! this helped me sooo much :)
@ethioprogrammingtips6917
@ethioprogrammingtips6917 2 жыл бұрын
a lot of thanks dear
@siddie229
@siddie229 7 ай бұрын
Thanks sir my test is tomorrow
@stealthforlife6941
@stealthforlife6941 7 ай бұрын
how did it go siddie229
@siddie229
@siddie229 7 ай бұрын
@@stealthforlife6941 it went quite good
@RavshanZayniyev
@RavshanZayniyev 2 жыл бұрын
Thanks
@mistwolf360
@mistwolf360 Жыл бұрын
thanks :)
@gwenaelle7993
@gwenaelle7993 Жыл бұрын
got to use acronyms like that thnks
@geezer1024
@geezer1024 2 жыл бұрын
Big Huffa ftw
@themastermind5368
@themastermind5368 5 ай бұрын
let's assume instead of sp being 3, it was 5 (ignoring the rest of the characters with higher frequencies for now), then would we still have done n+sp which would be 2+5=7, or would we add 4+n which would add up to 6?
@unizfrhn2803
@unizfrhn2803 Жыл бұрын
8:54 = the titles of the things 10:19 = How many bits there are in the encoded message
@roshanadhikari4185
@roshanadhikari4185 Жыл бұрын
Do capital small letter should be consider different?
@MrAWDimmick
@MrAWDimmick Жыл бұрын
Yes, they should be as they are represented as different characters (with different numerical/binary representations).
@jesusmagas7096
@jesusmagas7096 8 ай бұрын
Learn about ASCII that's the proper place
@ahmadiraqi2476
@ahmadiraqi2476 16 күн бұрын
King
@salehmubarak4137
@salehmubarak4137 2 ай бұрын
at the end of the video, you talked about decoding it again which was "BOB IS BIG" how did you get the binary bits of this message???
@LuthfiAlv
@LuthfiAlv Жыл бұрын
where did the number 7 come from ?? pls anyone help me.. 10:30
@panzerkliment966
@panzerkliment966 Жыл бұрын
Its from ASCII, which uses 7 bits to encode a letter, since there are 21 total letters, and each letter takes 7 bits, the totals bits required is 21 multiplied by 7. Compare this to only 67 bits when we compress rather than using ascii.
@Tomfreed
@Tomfreed Ай бұрын
pee
3.4 Huffman Coding - Greedy Method
17:44
Abdul Bari
Рет қаралды 1,5 МЛН
Huffman Codes: An Information Theory Perspective
29:11
Reducible
Рет қаралды 222 М.
TRY NOT TO LAUGH 😂
00:56
Feinxy
Рет қаралды 17 МЛН
100❤️
00:20
Nonomen ノノメン
Рет қаралды 75 МЛН
Which one of them is cooler?😎 @potapova_blog
00:45
Filaretiki
Рет қаралды 10 МЛН
Sprinting with More and More Money
00:29
MrBeast
Рет қаралды 184 МЛН
How Dijkstra's Algorithm Works
8:31
Spanning Tree
Рет қаралды 1,3 МЛН
Huffman Encoding
17:36
Lalitha Natraj
Рет қаралды 29 М.
How to create a Huffman Tree and find Huffman codes of characters: Solved Example
9:09
Huffman Coding (Lossless Compression Algorithm)
10:03
MrBrownCS
Рет қаралды 66 М.
How Huffman Trees Work - Computerphile
11:07
Computerphile
Рет қаралды 251 М.
5 Useful F-String Tricks In Python
10:02
Indently
Рет қаралды 264 М.
The Truth About Learning Python in 2024
9:38
Internet Made Coder
Рет қаралды 127 М.
Understanding B-Trees: The Data Structure Behind Modern Databases
12:39
TRY NOT TO LAUGH 😂
00:56
Feinxy
Рет қаралды 17 МЛН