tl;dr: Fancy algorithms are slow when n is small, and n is usually small. (Rob P... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

mdemare on Nov 2, 2010 | parent | context | favorite | on: Naggum Nugget

tl;dr: Fancy algorithms are slow when n is small, and n is usually small. (Rob Pike).

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact