|
|
|
| P is for Practical | |
| PerlMonks |
Re^2: improving the efficiency of a scriptby lima1 (Curate) |
| on Jun 18, 2006 at 17:48 UTC ( [id://556130]=note: print w/replies, xml ) | Need Help?? |
|
I'm not sure how efficient (or otherwise) it is
Much better than OPs solution ;) but time and space requirements for the data preparation is still O(n). much more than 0(m * log(n)) and O(m), respectively (once again, for sorted dictionaries only). So if dictionary is unsorted, the memory requirements are not a problem and if this task is not often repeated, yours is the best solution IMHO.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||