Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

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

by BrowserUk (Pope)
on Jan 26, 2013 at 01:39 UTC ( #1015444=note: print w/ replies, xml ) Need Help??


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

e.g. “25 days vs. 1.3 seconds” but, honestly, I don’t think anyone seriously benefits from such outlandish comparisons.

What is so "outlandish" about pointing out the difference that using a O(N2) proposal, instead of one of the three O(N) solutions already suggested, would make?

It is exactly these kinds of untested postulations you've become famous for. Perhaps it was ...

Oh! BTW, after further assessment, that 25 days projection proves to be a gross underestimate.


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.


Comment on Re^2: Array vs. Hash for sparsely integer-indexed data
Re^3: Array vs. Hash for sparsely integer-indexed data
by roboticus (Canon) on Jan 26, 2013 at 14:39 UTC

    Heh ... calls to mind: this XKCD comic.

    ...roboticus

    When your only tool is a hammer, all problems look like your thumb.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (13)
As of 2014-07-29 14:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (218 votes), past polls