|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re^5: Common hash keysby jethro (Monsignor) |
| on Jun 07, 2008 at 12:56 UTC ( [id://690832]=note: print w/replies, xml ) | Need Help?? |
|
computer scientist generally don't see a problem with that since the algorithm is still O(n), which means the time (and space) to compute it grows only linear with the number of keys in the hashes. Many algorithms are not that nice.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||