Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!newsstand.cit.cornell.edu!news.kei.com!newsfeed.internetmci.com!in2.uu.net!netnews.jhuapl.edu!aplcenmp!hall
From: hall@aplcenmp.apl.jhu.edu (Marty Hall)
Subject: Re: permutation
Message-ID: <DM3n2L.2rL@aplcenmp.apl.jhu.edu>
Organization: JHU/APL Research Center, Hopkins P/T CS Faculty
References: <4em977$osl@spool.cs.wisc.edu> <4eodp9$gur@sungod.isi.edu>
Date: Thu, 1 Feb 1996 13:35:09 GMT
Lines: 13

In <4eodp9$gur@sungod.isi.edu> philpot@sungod.isi.edu (Andrew Philpot) writes:
>In <4em977$osl@spool.cs.wisc.edu> so@brownie.cs.wisc.edu (Bryan So) writes:
>>I wonder if anyone has what they think is the simplest, shortest
>>implementation of "permutation" that can share with me.  e.g.,

>Oddly enough, there is a solution to a closely related problem in
>Winston and Horn, Lisp (2d ed.) that is about 20 lines long using
>three functions.

PAIP has an 8-line solution on page 150.
						- Marty

(proclaim '(inline skates))   http://www.apl.jhu.edu/~hall/lisp.html
