Members - Reputation: 659
Posted 24 December 2012 - 04:31 AM
If you do use a hash table (and this is probably the easier method), watch out for memory allocations. In C++, std::unordered_map will allocate per entry, and this is slow.
There's more to making collisions go fast. I've written about it here: