Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bcbrown
on July 7, 2014
|
parent
|
context
|
favorite
| on:
Rob Pike's Rules of Programming
If you can get a naive n^2 solution, or build a complicated nlgn solution, and you know the size of the data will be ~100 items, certainly never >1000 solutions, I'd choose the naive solution.
Edit: and it's not in the middle of a tight loop
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Edit: and it's not in the middle of a tight loop