五个编程原则：Rob Pike‘s 5 Rules of Programming

原文

https://users.ece.utexas.edu/~adnan/pike.html
Rob Pike’s 5 Rules of Programming
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.
Rule 2. Measure. Don’t tune for speed until you’ve measured, and even then don’t unless one part of the code overwhelms the rest.
Rule 3. Fancy algorithms are slow when n is small, and n is usually small. Fancy algorithms have big constants. Until you know that n is frequently going to be big, don’t get fancy. (Even if n does get big, use Rule 2 first.)
Rule 4. Fancy algorithms are buggier than simple ones, and they’re much harder to implement. Use simple algorithms as well as simple data structures.
Rule 5. Data dominates. If you’ve chosen the right data structures and organized things well, the algorithms will almost always be self-evident. Data structures, not algorithms, are central to programming.
Pike’s rules 1 and 2 restate Tony Hoare’s famous maxim “Premature optimization is the root of all evil.” Ken Thompson rephrased Pike’s rules 3 and 4 as “When in doubt, use brute force.”. Rules 3 and 4 are instances of the design philosophy KISS. Rule 5 was previously stated by Fred Brooks in The Mythical Man-Month. Rule 5 is often shortened to “write stupid code that uses smart objects”.

翻译

Rob Pike的编程五原则
规则1. 你无法确定程序将花费时间的具体位置。瓶颈往往出现在意想不到的地方，因此不要试图预测并在证明瓶颈位置之前进行速度优化。
规则2. 测量。在测量之前不要为了速度进行调优，即使在测量之后，也不要调优，除非代码的某一部分压倒了其他部分。
规则3. 在n很小时，复杂算法速度很慢，而且n通常很小。复杂算法具有很大的常数。除非你知道n经常会变大，否则不要使用复杂算法。（即使n变大，也要先遵循规则2。）
规则4. 复杂算法比简单算法更容易出错，而且实现起来更困难。使用简单算法以及简单数据结构。
规则5. 数据至关重要。如果你选择了正确的数据结构并组织得当，算法几乎总是不言自明的。数据结构而不是算法是编程的核心。
Pike的第1和第2条规则重新阐述了Tony Hoare的著名格言“过早优化是万恶之源”。Ken Thompson将Pike的第3和第4条规则重新表述为“怀疑时，使用暴力法”。规则3和规则4是KISS设计哲学的实例。规则5以前由Fred Brooks在《人月神话》中提出。规则5通常缩写为“编写使用智能对象的愚蠢代码”。