Can u elaborate more? On Sep 28, 5:41 am, saurabh singh <saurabh.n...@gmail.com> wrote: > u can use log(n)+1 space to do that by using bit string > > > > > > On Mon, Sep 27, 2010 at 10:37 PM, AdrianW <atw...@gmail.com> 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 algoge...@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups > > .com> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > Thanks & Regards, > Saurabh
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
