«

Can anyone suggest an algorithm to find the anagrams
of a string (using dictionary words as an input).
If you feel this is not a relevant C question please suggest
some newgroup where this may be posted.

Thanx for any help in advance ...

<> wrote in message
news: ups.com...
> Can anyone suggest an algorithm to find the anagrams
> of a string (using dictionary words as an input).
> If you feel this is not a relevant C question please suggest
> some newgroup where this may be posted.

comp.programming would be better. There are lots of ways to do this. Hint:
the word "was" has one A, one S and one W. So does the word "saw", which is
an anagram of "was".

Alex

"Alex Fraser" <> wrote in message
news:ytydnRU9DKH-...
> <> wrote in message
> news: ups.com...
> > Can anyone suggest an algorithm to find the anagrams
> > of a string (using dictionary words as an input).
> > If you feel this is not a relevant C question please suggest
> > some newgroup where this may be posted.
>
> comp.programming would be better. There are lots of ways to do this.
Hint:
> the word "was" has one A, one S and one W. So does the word "saw",
which is
> an anagram of "was".
>

Workhome is an anagram for...

--
Mabden

Mabden said:

> "Alex Fraser" <> wrote in message
> news:ytydnRU9DKH-...
>> <> wrote in message
>> news: ups.com...
>> > Can anyone suggest an algorithm to find the anagrams
>> > of a string (using dictionary words as an input).
>> > If you feel this is not a relevant C question please suggest
>> > some newgroup where this may be posted.
>>
>> comp.programming would be better. There are lots of ways to do this.
> Hint:
>> the word "was" has one A, one S and one W. So does the word "saw",
> which is
>> an anagram of "was".
>>
>
> Workhome is an anagram for...

I get 20160 different answers for this from my anagram program, but I'm
guessing the one you mean is:

mworekoh

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/2005
http://www.cpax.org.uk
email: rjh at above domain (but drop the www, obviously)

Richard Heathfield wrote:
>
> Mabden said:
>
> > "Alex Fraser" <> wrote in message
> > news:ytydnRU9DKH-...
> >> <> wrote in message
> >> news: ups.com...
> >> > Can anyone suggest an algorithm to find the anagrams
> >> > of a string (using dictionary words as an input).
> >> > If you feel this is not a relevant C question please suggest
> >> > some newgroup where this may be posted.
> >>
> >> comp.programming would be better. There are lots of ways to do this.
> > Hint:
> >> the word "was" has one A, one S and one W. So does the word "saw",
> > which is
> >> an anagram of "was".
> >>
> >
> > Workhome is an anagram for...
>
> I get 20160 different answers for this from my anagram program, but I'm
> guessing the one you mean is:
>
> mworekoh
>
how, o kmer?

Wolfgang Riedel said:

> Richard Heathfield wrote:
>>
>> Mabden said:
>>
>> > "Alex Fraser" <> wrote in message
>> > news:ytydnRU9DKH-...
>> >> <> wrote in message
>> >> news: ups.com...
>> >> > Can anyone suggest an algorithm to find the anagrams
>> >> > of a string (using dictionary words as an input).
>> >> > If you feel this is not a relevant C question please suggest
>> >> > some newgroup where this may be posted.
>> >>
>> >> comp.programming would be better. There are lots of ways to do this.
>> > Hint:
>> >> the word "was" has one A, one S and one W. So does the word "saw",
>> > which is
>> >> an anagram of "was".
>> >>
>> >
>> > Workhome is an anagram for...
>>
>> I get 20160 different answers for this from my anagram program, but I'm
>> guessing the one you mean is:
>>
>> mworekoh
>>
> how, o kmer?

o.k., he worm!

(Can we take the other 20157 followups as read?)

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/2005
http://www.cpax.org.uk
email: rjh at above domain (but drop the www, obviously)

"Richard Heathfield" <> wrote in message
news:dglvbq$fu2$...
> Wolfgang Riedel said:
>
> > Richard Heathfield wrote:
> >>
> >> Mabden said:
> >>
> >> > "Alex Fraser" <> wrote in message
> >> > news:ytydnRU9DKH-...
> >> >> <> wrote in message
> >> >> news: ups.com...
> >> >> > Can anyone suggest an algorithm to find the anagrams
> >> >> > of a string (using dictionary words as an input).
> >> >> > If you feel this is not a relevant C question please suggest
> >> >> > some newgroup where this may be posted.
> >> >>
> >> >> comp.programming would be better. There are lots of ways to do
this.
> >> > Hint:
> >> >> the word "was" has one A, one S and one W. So does the word
"saw",
> >> > which is
> >> >> an anagram of "was".
> >> >>
> >> >
> >> > Workhome is an anagram for...
> >>
> >> I get 20160 different answers for this from my anagram program, but
I'm
> >> guessing the one you mean is:
> >>
> >> mworekoh
> >>
> > how, o kmer?
>
> o.k., he worm!
>
> (Can we take the other 20157 followups as read?)

ho, me ok R/W.