Re^4: "Just use a hash": An overworked mantra?

[Anonymous Monk]

in reply to Re^3: "Just use a hash": An overworked mantra?
in thread "Just use a hash": An overworked mantra?

And - your last link does not even mention hashes. Bother explain what is doing here? TIA!

Look at the table

Here are some well-known algorithms and their order functions (adapted from [2]):

Notation       Name       Example
O(1)       constant       array or hash index

...

2. Kernighan, B. W. & Pike, R., (1999). The Practice of Programming, p. 41. Addison-Wesley.

yes. I am sure.

Great, prove it :)

[vkon]

kewl.
thanks for the pointer in a table, I overlooked it - indeed - it takes a special care to find this place, since the only mention w/o any argumentation - not in line of overall text, easy to e\overlook, and - still - does not convince me - where is argumentation?
a bit pity that O(1) for hashes actually do not reflects on what is actually going on inside perl.

for a prove of my point - well, look into perl implementation of hashes - just read the comments - and you will see it.

Convincing?
Well, URLs provided to me are even less convincing..... :o

[Anonymous Monk]

for a prove of my point - well, look into perl implementation of hashes - just read the comments - and you will see it.

you know where to look? I don't believe it :p