Since each array has only UNIQUE values, hashing may achieve better performance. The problem is finding a good hash function which is both fast and collision-free. Collision-free means the following iteration and search in another array can be as fast as possible.
Ovidiu.Silaghi wrote: > The arrays have only UNIQUE values and the same dimension! Arrays are --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
