Hi Darin! :-)

 PS>> That one is very memory efficient, though, and good enough for 
 PS>> smaller input sets. Think about using your approach for 64 bit 
 PS>> integers, how much memory would your hash table consume?
 DM> With a reasonable hash algorithm, not much more space than the 
 DM> original list ;-)
Sure, but what's a good hash for random numbers? ;)

Ciao
Pascal

--- Msged/LNX 6.1.1