Keith and all,
Thanks for the help. I now understand the ways of my confusion! I
did not understand that the input stream also contained the anagrams! I was
under the impression that all anagrams in the input stream had to be found.
Oh well, there's TPR(0.4)! It always helps to fully understand the problem
at hand!
Thanks Again!
..mark
--=={-----Original Message-----
--=={From: Keith C. Ivey [mailto:[EMAIL PROTECTED]]
--=={Sent: Monday, April 08, 2002 5:29 PM
--=={To: [EMAIL PROTECTED]
--=={Subject: RE: Please explain
--=={
--=={
--=={Mark Schoonover <[EMAIL PROTECTED]> wrote:
--=={
--=={> I can see how the characters in
--=={> elvis and lives word sort the same. So would viles. IIUC, seliv
--=={> would sort the same way as viles but seliv is not a word, it is
--=={> merely a string of letters. Am I thinking too hard on this one
--=={> or am I just royally missing something?
--=={
--=={It seems that what you're missing is that only words that are
--=={in the file to begin with get printed. So yes, if you had
--=={'seliv' or 'viles' in the file along with 'elvis' or 'lives',
--=={they'd get included in the list of anagrams. There's no
--=={magical dictionary involved.
--=={
--=={--
--=={Keith C. Ivey <[EMAIL PROTECTED]>
--=={Washington, DC
--=={
--=={
