C++ HashTable Question

Question

If I use an array of linked list to implement a hash table, the "remove" function might require traversing through a "chain."

Is this also true for "deleting"?

Carl Norum · Accepted Answer · 2009-10-25 02:35:39Z

1

Sure, it applies to anything you try to do with the hash table. Remove, delete (which sound like the same thing to me), insert, search, you name it.

answered Oct 25, 2009 at 2:35

Carl Norum

226k42 gold badges442 silver badges480 bronze badges

Sign up to request clarification or add additional context in comments.

3 Comments

user40120 Over a year ago

What if i use an array of linked list to implement a hash table, my function, "add", could be implemented in a way that requires no probing???

Carl Norum Over a year ago

Yeah I guess that's true, as long as you're willing to use linear search on the chains. You could just add your new item to the head of the chain.

user40120 Over a year ago

Thanks Carl, I just have one last question: When and If I use the linked list method, will i have direct access to the beginning of each individual chain?

bdonlan · Accepted Answer · 2009-10-25 02:40:03Z

1

Yes. Nearly any operation may require following these chains. The key is to select a table size and hash function such that chains are typically short (ideally, nearly all of them should have no more than one item).

answered Oct 25, 2009 at 2:40

bdonlan

233k31 gold badges275 silver badges326 bronze badges

Collectives™ on Stack Overflow

C++ HashTable Question

2 Answers 2

3 Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

3 Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related