I received some 'interesting' feedback when I spoke about commenting that I was using an O(n) search instead of an O(log n) algorithm because of the normally sm

I received some 'interesting' feedback when I spoke about commenting that I was using an O(n) search instead of an O(log n) algorithm because of the normally small size of n [0] What I should have done was point to Rob's third rule (either in my comment or in the resulting threads) [0] https://news.ycombinator.com/threads?id=awesome_dude&next=47314703#47303759 https://news.ycombinator.com/threads?id=awesome_dude&next=47...