Perl-Sensitive Sunglasses | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
real-life alhorithms are O(log N) in best case, but I afraid Perl's one is worse than that I'd like to see you demonstrate that Perl's hashes are O(log N), let alone "worse than that"? With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
In reply to Re^4: "Just use a hash": An overworked mantra?
by BrowserUk
|
|