Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Array vs. Hash for sparsely integer-indexed data

by davido (Archbishop)
on Jan 25, 2013 at 18:59 UTC ( #1015390=note: print w/ replies, xml ) Need Help??


in reply to Array vs. Hash for sparsely integer-indexed data

It's hard to know how sparse your data set is, and how large the range. If you have 100 items with indices between 0 and 3_000_000, the array isn't going to work out so well. On the other hand, if you have 10_000 items with indices between 0 and 32767, the array wouldn't be so bad after all.

While hash insertions and lookups are both O(1) operations in order of growth, the constant factors are more expensive with hashes than with arrays. But do you know speed efficiency to be an issue?

Without knowing enough about the specifics of the problem, I would have to recommend a hash. Once specifics are known (how sparse, how wide the range of indices, and how time-critical the code is), that recommendation could change. But the hash is the "general" solution, where the array would be a solution tailored to a specific set of criteria.


Dave


Comment on Re: Array vs. Hash for sparsely integer-indexed data

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1015390]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (11)
As of 2014-08-20 18:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (121 votes), past polls