News for hackers. Stuff that matters.

A comment on How to Rock an Algorithms Interview. Parent comment

Re:How to Rock an Algorithms Interview by rcfox on Monday September 26, 2011 @04:27PM (#3040609)
That is true, but one generally doesn't care about the best case. It's a good point though.

(Also, if data is a linked-list, length() could be an O(n) operation. That would make this O(n^3) or O(n^4) ;))

[ Parent | on HN ]

There are no comments on this comment yet.