then access will not be O(1).. it will be on O(n) int he worst case when all the nodes are hash to same location
On Wed, Dec 22, 2010 at 12:50 PM, Ankur Khurana <ankur.kkhur...@gmail.com>wrote: > stroe the pointers in the hash table. it will do i suppose. > > On Wed, Dec 22, 2010 at 12:36 PM, snehal jain <learner....@gmail.com> > wrote: > > How could a linked list and a hash table be combined to allow someone > > to run through the list from item to item while still maintaining the > > ability to access an individual element in O(1) time > > > > -- > > 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. > > > > > > -- > 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. > > -- 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.
