Path: utzoo!mnetor!tmsoft!torsqnt!news-server.csri.toronto.edu!rutgers!att!tut.cis.ohio-state.edu!purdue!haven!adm!news
From: sbarnhar%MAILBOX.MAIL.UMN.EDU@uga.cc.uga.edu ( Shawn Barnhart)
Newsgroups: comp.lang.pascal
Subject: Anagram
Message-ID: <25369@adm.brl.mil>
Date: 2 Jan 91 17:36:45 GMT
Sender: news@adm.brl.mil
Lines: 17

Does anyone know of or know where I could find an algorithm for producing a
complete set of anagrams for for any string of length N?  It seems (to my
nonscientific mind) that the algorithm changes as more letters are added.  I was

able to produce one that worked for 3 and 4 letter strings, but after that it
broke down.  The bookstore here on campus had a smattering of CSci "101
algrotithms"-type books, but none mentioned algorithms for variable-length
(or any length, for that matter) anagrams.   I know this sounds like a tedious
CSci assignment, but ever since I saw my first issue of _Spy_ and their
"Monthly Anagram Analysis" I've had the burning desire to find them the brute
force way.  Reply here or to Email.  Gracias.

----------------------------------------------------------------
If you didn't get caught, how do you know that you did it?

sbarnhar@mailbox.mail.umn.edu
----------------------------------------------------------------