Fancy algorithms are slow when N is small, and N is usually small.

There's no such thing as a simple cache bug.

When there is no type hierarchy you don't have to manage the type hierarchy.

Rule 1. You can't tell where a program is going to spend its time. Bottlenecks occur in surprising places, so don't try to second guess and put in a speed hack until you've proven that's where the bottleneck is

Using Unix is the computing equivalent of listening only to music by David Cassidy.

There's nothing in computing that can't be broken by another level of indirection.

Narrowness of experience leads to narrowness of imagination