if space complexity is not a constraint..u can use any kind of hashing and its function.....depends on the kind of data we store..if its numbers go for square or simple linear function....
Regards, Adi Srikanth. Mob No 9887233349 Personal Pages: adisrikanth.co.nr On Fri, Sep 30, 2011 at 9:43 PM, Devesh Mittal <[email protected]>wrote: > Fibonacci Heaps > > > On Fri, Sep 30, 2011 at 9:14 PM, manish kapur > <[email protected]>wrote: > >> u have to perform following tasks in O(1) time >> 1.)insertion >> 2.)deletion >> 3.)searching >> no range of input numbers is given >> wat data structure will you use? >> if u use hashing wat will be the key and value pairs? >> >> -- >> 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. >> > > -- > 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. > -- 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.
