Hash is not O(1)
Are you sure?
I'll grant that an individual lookup might consume greater than O(1) time, but in the aggregate it's fairly well established and accepted that hash operations are O(1) operations, where 'n' is the number of elements in the hash.
Dave
In reply to Re^2: "Just use a hash": An overworked mantra?
by davido
in thread "Just use a hash": An overworked mantra?
by davido
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |