Day 33: Invention on a timetable.
Today, I was working on creating an algorithm to optimize binary search trees. Its not too hard to get a binary search tree optimized in O(n^3) time, but cutting it down to O(n^2) time has proven quite difficult. Dr. Knuth has an algorithm to do just that (written in 1971) but deriving and proving has been terrible. Six hours of work today on this and a few related problem with not much to show but intellectual progress. At least now I know what doesn’t work. That means something right?
So while I fire up XCode to figure this stuff out, here’s a nice little video from BBC and Google. Its going to be tough to hold out for an Android-based phone. I’m excited to see what’s next.

