* Using a hash is a pretty smart solution, except:Assuming the hash can fit in memory, it has roughtly constant time for lookups; there is no need for a pretty hashing function as such a function is already used interally - that's why it's called a hash!
- It has memory implication (hence not always can be used);
- It slows down considerably for huge arrays (or, at least you have to build your own hash structure with some pretty hashing function);
Dave.
In reply to Re: “A meeting at the Liquor-Vodka Factory”, or… same ARRAY questions again?!!
by dave_the_m
in thread “A meeting at the Liquor-Vodka Factory”, or… same ARRAY questions again?!!
by Mabooka-Mabooka
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |