Rob Pike's third rule of programming suggests avoiding fancy algorithms, as they are often slow for small numbers and typically only work effectively at scale.

“The claim accurately reflects the core of Rob Pike's third rule of programming. Multiple computer science and programming sources state the rule as: "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." The claim correctly summarizes this principle, emphasizing that complex algorithms can be inefficient for small datasets, which are common in practice. Context: This rule is part of a larger set of five programming principles that prioritize measurement, simplicity, and data structures over premature optimization and algorithmic complexity. The fourth rule is a companion to the third, adding that fancy algorithms are also buggier and harder to implement.”