News for hackers. Stuff that matters.
Re:Crit-bit Trees: the best way to store sets by kragen on Monday September 19, 2011 @11:03PM (#3016089)
The particular words you've quoted have managed to condense a thousand pictures — an infinite number, really — into 45 words. It's kind of a counterexample.

Some examples would certainly help, and probably diagrams would help understanding the examples.

Re:Crit-bit Trees: the best way to store sets by viraptor on Tuesday September 20, 2011 @06:43AM (#3017043)
That's assuming you take "nonempty prefix-free set", "internal node", "bit string x such that x0 and x1" (not sure if they're supposed to be subscripts or are 0 and 1 bits) for granted. A picture solves the problem in many ways giving you real examples.

It's 45 words with lots of assumed knowledge that you could write books about ;)