http://www.perlmonks.org?node_id=428910


in reply to Re^4: OOP/Linked List Question
in thread OOP/Linked List Question

Well, have fun. Just remeber that O-notation comparisons of different algorithms general carry an unstated "all other things being equal" clause.

That is, an O(N) algorithm written in C (like splice), may outform a O(1+a few bits) algorithm written in Perl, if N is fairly small (and 50-1500 is small in this context) and those "few bits" consitute several lines of Perl.


Examine what is said, not who speaks.
Silence betokens consent.
Love the truth but pardon error.