Stayed up way too late getting my recursive Huffman tree crawler sort of working. Found all kinds of cute examples on the web where they encode things as short as "Bill Gates" all the way up to "The quick red fox jumped over the lazy brown dog." What they don't tell you is that the number of spaces in a 22K text file make the tree so lopsided that it lists alarmingly to one side or the other. It helps a little if you set up the encoder so that it crawls the heavy side first, But you can't always know in advance which side that is going to be. Or can you?
Needs more fooling with, but there's a Statistics and Probability test tomorrow that needs fooling with a lot worse. And the demands of these on-line classes are driving me to distraction.
So what am I doing?
Winding down from the stress of pushing two buttons at the grade school down the street, I guess.