it depends on whether N strings are a subset of a finite set of strings and the hash function.
collision happens when # of keys > # of H(keys) by following that, you dont even need an algorithm to find the collision. otherwise, there would always be up to N additional storage becoz you need to generate the hash first unless you know how to hack the hash function. i think it's always speed vs. space @saurabh i would love to know about the bit string solution On Sep 27, 1:07 pm, AdrianW <[email protected]> wrote: > Suppose you have N strings that can be generated on-the-fly, and you > wanted to discover if a hash function generates any collisions. Is > there a way to do this without O(N) storage? -- 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?hl=en.
