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"?
In reply to Re^4: "Just use a hash": An overworked mantra?
by BrowserUk
in thread "Just use a hash": An overworked mantra?
by davido
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |