The old anagram problem with open address hashing HS77154

[DK15798]

Anybody think there is a way to solve the anagram problem (reading in
a dictionary of words and printing out the anagrams for all words)
with an open address hash table as opposed to a chained hash table?

 

[John Harrison]

Anybody think there is a way to solve the anagram problem (reading in
a dictionary of words and printing out the anagrams for all words)
with an open address hash table as opposed to a chained hash table?

Open addressing and chaining are two different ways of implementing the
same functionality. So of course anything that can be solved with chaining
can also be solved with open addressing.

Did you have a question about C++?

john