The old anagram problem with open address hashing HS77154

Discussion in 'C++' started by DK15798, Jul 9, 2004.

  1. DK15798

    DK15798 Guest

    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?
    DK15798, Jul 9, 2004
    #1
    1. Advertising

  2. [OT] Re: The old anagram problem with open address hashing HS77154

    On 9 Jul 2004 08:26:42 -0700, DK15798 <> wrote:

    > 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
    John Harrison, Jul 9, 2004
    #2
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. BjoernJackschina

    anagram problem

    BjoernJackschina, May 12, 2004, in forum: C++
    Replies:
    1
    Views:
    467
    Leor Zolman
    May 12, 2004
  2. Jim Hill
    Replies:
    3
    Views:
    398
    Jim Hill
    Feb 12, 2007
  3. *Prot3anThr3ad*

    old repository for old C++ source code

    *Prot3anThr3ad*, Sep 29, 2006, in forum: C++
    Replies:
    6
    Views:
    371
    *Prot3anThr3ad*
    Oct 2, 2006
  4. Kam-Hung Soh
    Replies:
    16
    Views:
    494
    Kam-Hung Soh
    May 11, 2008
  5. Peter Kimani

    finding anagram of words

    Peter Kimani, May 3, 2009, in forum: Ruby
    Replies:
    2
    Views:
    118
    Robert Dober
    May 3, 2009
Loading...

Share This Page