Fancy algorithms are slow when N is small, and N is usually small.
Procedure names should reflect what they do; function names should reflect what they return - Rob Pike
Procedure names should reflect what they do; function names should reflect what they return
- Rob Pike
Data dominates. If you've chosen the right data structures and organized things well, the algorithms will almost always be self-evident. Data structu… - Rob Pike
Data dominates. If you've chosen the right data structures and organized things well, the algorithms will almost always be self-evident. Data structu…
Object-oriented design is the roman numerals of computing. - Rob Pike
Object-oriented design is the roman numerals of computing.
Languages that try to disallow idiocy become themselves idiotic. - Rob Pike
Languages that try to disallow idiocy become themselves idiotic.
Fancy algorithms are slow when N is small, and N is usually small. - Rob Pike
Eventually, I decided that thinking was not getting me very far and it was time to try building. - Rob Pike
Eventually, I decided that thinking was not getting me very far and it was time to try building.
Narrowness of experience leads to narrowness of imagination - Rob Pike
Narrowness of experience leads to narrowness of imagination
Caches aren't architecture, they're just optimization. - Rob Pike
Caches aren't architecture, they're just optimization.
Not only is UNIX dead, it's starting to smell really bad. - Rob Pike
Not only is UNIX dead, it's starting to smell really bad.
Login to join the discussion
Login to join the discussion