Hacker News new | ask | show | jobs
by MadVikingGod 1965 days ago
In a traditional tree you just store a bunch of y's. So let's say 7 points are just y0-y6. In a tree you would need at least 7 keys stored. In this you would just have m and b stored and you would use the formula to look up the index.
1 comments

Thanks, that really helps get an intuition for how this works! It's pretty clever really.