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.
-- Rob Pike
(Even if n does get big, use Rule 2 first.)
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.
-- Rob Pike
(Even if n does get big, use Rule 2 first.)