All depends on what you mean by 'reasonable', how many unique keys you have, how much memory you have, and how often you'll be iterating through non-existent array elements (with the array of arrays approach - well, that won't matter memory-wise, but speed wise...), and whether you really need to worry about it. If you're only using half the elements, then an array of arrays will still win memory-wise. Hashes will take 5-10 times (very rough estimate) more space with an equal # of keys.
In reply to Re: Array vs. Hash (newbie perlguts)
by runrig
in thread Array vs. Hash (newbie perlguts)
by perchance
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |