http://www.jguru.com/faq/view.jsp?EID=430247
There exists some differences though in Java On Sun, Jul 24, 2011 at 12:03 PM, rajeev bharshetty <[email protected]>wrote: > Hash Table and hash map are same . > For insertion might take O(1) time if a good hash function is used . and > searching also O(1) considering no collisions. > > > > On Sun, Jul 24, 2011 at 11:31 AM, sivaviknesh s <[email protected]>wrote: > >> what is the time complexity of a hash map??....for insertion and searching >> >> are hash table and hash map same ?? >> >> ....can anybody give a good explanation with example or even suggest good >> links.....thanks in advance :) >> >> >> >> -- >> Regards, >> $iva >> >> -- >> 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. >> > > > > -- > Regards > Rajeev N B <http://www.opensourcemania.co.cc> > > -- Regards Rajeev N B <http://www.opensourcemania.co.cc> -- 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.
