Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site sdcrdcf.UUCP Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!genrad!decvax!ittvax!dcdwest!sdcsvax!sdcrdcf!lwall From: lwall@sdcrdcf.UUCP (Larry Wall) Newsgroups: net.lang.c Subject: Re: Need C Algorithm Message-ID: <1557@sdcrdcf.UUCP> Date: Fri, 14-Dec-84 16:35:58 EST Article-I.D.: sdcrdcf.1557 Posted: Fri Dec 14 16:35:58 1984 Date-Received: Mon, 17-Dec-84 03:08:23 EST References: <1289@eosp1.UUCP> <174@masscomp.UUCP> Reply-To: lwall@sdcrdcf.UUCP (Larry Wall) Organization: System Development Corp. R+D, Santa Monica Lines: 18 Summary: In article <174@masscomp.UUCP> lip@masscomp.UUCP (John Lipinski) writes: >For Warren Lobel at Exxon Office Systems, who requested a solution >to the permutation problem. The following C program takes a string >as an argument and prints out the list of permutations. It is a very >interesting algorithm. Yes, it is interesting. It looks suspiciously like a change ringing algorithm. Can any of you Anglophiles confirm that? For that matter, can any of you Angles across the water confirm it? (Or do Angles qualify as Anglophiles?) For those of you who haven't heard of change ringing, it is an artform practiced by the British in which a set of tuned bells is rung through all possible permutations. For an enjoyable introduction to the topic I would recommend the mystery novel The Nine Tailors by Dorothy L. Sayers. Larry Wall {allegra,burdvax,cbosgd,hplabs,ihnp4,sdcsvax}!sdcrdcf!lwall