This is so much more straightforward than the explanations we get at college: "Well you know, now you need to substitute this leaf with this subtree, and look, now we need more substitutions" >_>
Let's be a little more professional with your language here.
This example plus the slightly more complex one in Cormen et al. gives one the ability to generalize the solution to any set of nodes. Do you really want to listen to someone for 20 minutes while they walk through a 25-node example?
Video quality is a result of YouTube's 100MB limitation. This piece was generated almost two years ago with dated technology. Even so, the others who commented have been happy, so I've left it up.
the others do not know what your on about, im studying this for my exam, so need to know how to create a 15 node tree. plus your explanation was tooooooooooooo long, i could have explained that example in a minute, since the numbers you used were easy.
fact is your misleading people by changing the numbers. so in conclusion your teaching them wrong information, the huffman tree for the original numbers is different to the one you produced
@katul02 actually, considering the lack of computer science related videos on the web, this one is pretty great. so in conclusion, shut your fucking mouth nerd.
You could just move the decimal over 2 places to the right and say that "s" occurs 58 times, "t" occurs 28 times, "u" occurs 9 times, "v" occurs 4 times, and "w" occurs once.
You start with the two that occur the least number of times (which is v & w) and add the number of occurrences together.
Very simple, I like it.
TheMagwe25 1 month ago
this was very helpful..thanks! :)
emagirl33 1 month ago
Excellent video - ignore the trolls please. This is clear and concise, just the way it should be!
7thAttempt 1 month ago
Very helpful video, thanks a lot!
Zerran48 2 months ago
Great!! Thank you!!
iMercury989 2 months ago
Thank you SO much for this video, this was very helpful!!!
bluieberrysoda 2 months ago
Thanks this was very helpful!
goalieguy60 3 months ago
Just what I needed to understand my Analysis of Algorithms class!
summeroverture 3 months ago
thanks helps alot with my university work!
9048benshelton 3 months ago
i was sick and missed a lecture and this was the perfect video. thanks
italymc12 4 months ago
Thank you for saving my midterm
Bubblewhip341 4 months ago
THANKS your explanation is so EASY and fast i can go to my exam now xD
xSYNDICATEDx 4 months ago
Thanks, nice to understood
judearasu 4 months ago
Simple explanation, but gets the point across. Thanks!
xTimmAx 4 months ago
good explanation thanks
SICKESTmusic 6 months ago
you could have used different colors for the nodes..I like the cat though :-)) thanks
AJSwisgirl 6 months ago
thanks a lot. nice and simple. :)
spots2012 6 months ago
excellent thanks
sneak2attack 7 months ago
very good explanation.. Thanks...
judesfernando 8 months ago
this is so cooooooool u saved me i have an exam tomorrow than you very much, keep going
MrElkberAwy 8 months ago
what about decoding the tree when it reaches the destination can u explain how it is done?
aoapao 8 months ago in playlist Data; Decoding, etc
This has been flagged as spam show
Super simple and easy to understand. Thanks a bunch.
KFA80 8 months ago in playlist Programming
Super simple and easy to understand. Thanks a bunch
KFA80 8 months ago in playlist Programming
great thanks
dhulme2 9 months ago
Fantastic
good video
AHMEDSHARK4313 9 months ago
perfect thank you!
ibanez1andrew 9 months ago
How did the values change when you went from the table to the nodes?
0:46 - 0:50
crazyidiot101 9 months ago
Great, thanks
abovestand 10 months ago
Ooohhhh I didn't think about comparing the results of the two nodes-thank you!
satinflame 10 months ago
Very clear! Thanks for the add.
aualdrich 10 months ago
well explained
flutep 11 months ago
Very great example!
mvilla213 11 months ago
Danke aus germany
assan52 1 year ago
This is so much more straightforward than the explanations we get at college: "Well you know, now you need to substitute this leaf with this subtree, and look, now we need more substitutions" >_>
Thank you.
RazyMon 1 year ago
Love the explanation thank you :)
aughamullan 1 year ago
Thank you! :D
eggsopp 1 year ago
short and sweet~
benz076 1 year ago
THANK YOU
ibrahim100k4real 1 year ago
easy to understand :)
RIyengarvasudha 1 year ago
thank you so much!!!!!!
asda110knm 1 year ago
thank u so much for the explanation, now i understand how we got the codeword..
oldschooljam10 1 year ago
Thanks this was really helpful, now I will be able to program it.
diegoramos27 1 year ago
poor visibility spoils the whole video... :-/
greeppl 1 year ago
Have an exam in like 2 hours and came on youtube... great little video, should help me big time this morning. Thanks!
CHPatCH 1 year ago
ok i understodd it but not completely. i positioned them a lil bit different. and got now other values for example: i got for t=00 and for w=101
is this also correct?
christianplive 2 years ago
This has been flagged as spam show
the colours you have chosen reduce visability and the shit quality of the video further reduces clarity
your explanantion sucks - what about harder examples - this example is too easy.
why did the value of your nodes change
katul02 2 years ago
Let's be a little more professional with your language here.
This example plus the slightly more complex one in Cormen et al. gives one the ability to generalize the solution to any set of nodes. Do you really want to listen to someone for 20 minutes while they walk through a 25-node example?
Video quality is a result of YouTube's 100MB limitation. This piece was generated almost two years ago with dated technology. Even so, the others who commented have been happy, so I've left it up.
travelschlepp 2 years ago 16
the others do not know what your on about, im studying this for my exam, so need to know how to create a 15 node tree. plus your explanation was tooooooooooooo long, i could have explained that example in a minute, since the numbers you used were easy.
fact is your misleading people by changing the numbers. so in conclusion your teaching them wrong information, the huffman tree for the original numbers is different to the one you produced
katul02 2 years ago
@katul02 yeah bitch
paperboy438 1 year ago
@katul02 actually, considering the lack of computer science related videos on the web, this one is pretty great. so in conclusion, shut your fucking mouth nerd.
MoT359 1 year ago
@katul02 if you can't understand such a well explained tutorial, may GOD bless you
flutep 11 months ago
Comment removed
katul02 2 years ago
M8 ur initial values change
you said first w=0.01
then it became 0.09
WTF are you doing, you cant decide to randomly change the values
katul02 2 years ago
I thank you so much for this explanation!!!
Crayfish1010 2 years ago
Thank you!!!
88Anit 2 years ago 6
Thanks. I was just starting to work on a homework problem about Huffman and this really helped me out!
DrSayre 2 years ago
He makes it sound complex but it is rather simple one you figure it out. The word frequency really means "number of occurrences".
H0D0NKAIN 3 years ago
You could just move the decimal over 2 places to the right and say that "s" occurs 58 times, "t" occurs 28 times, "u" occurs 9 times, "v" occurs 4 times, and "w" occurs once.
You start with the two that occur the least number of times (which is v & w) and add the number of occurrences together.
H0D0NKAIN 3 years ago
How do u get the weights thou to start?
lorenita4 3 years ago