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 :)
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^5: "Just use a hash": An overworked mantra?
by vkon (Curate) on Dec 24, 2011 at 21:11 UTC | |
by Anonymous Monk on Dec 24, 2011 at 21:25 UTC |
In Section
Meditations