Hello Pascal!

Replying to a message of Pascal Schmidt to Neil Heller:

 PS> What I'm saying is that sometimes an algorithm that looks faster on
 PS> paper turns out to suck in practise.

 PS>>> The most primitive algorithm for this problem 
 PS>>> (compare each with each) would be O(n^2).
 NH>> Yipes, I hope it doesn't come to that.
 PS> That one is very memory efficient, though, and good enough for smaller
 PS> input sets. Think about using your approach for 64 bit integers, how
 PS> much memory would your hash table consume?

With a reasonable hash algorithm, not much more space than the original list ;-)

Darin

---