Re: Quick permutations, another entry

• To: info-dylan@ai.mit.edu
• Subject: Re: Quick permutations, another entry
• From: oodl@my-deja.com
• Date: Tue, 23 Jan 2001 21:45:02 -0500 (EST)
• Organization: Deja.com
• References: <94ac3d$6j9$1@nnrp1.deja.com> <94ibji$cne$1@nnrp1.deja.com> <94l65h$rn4$1@nnrp1.deja.com>
• Xref: traf.lcs.mit.edu comp.lang.dylan:13019

In article <94l65h$rn4$1@nnrp1.deja.com>,
  dauclair@hotmail.com wrote:
>
> > This runs in under 0.5 seconds on a 450Mhz, Pentium III.  If anyone
> > wants to improve the code, please go ahead.
>
> Yours certainly runs quickly!  Another entry comes from jt (jan) that
> also runs in less than 0.5 seconds and entirely side-steps the
> memory-management problem by only retaining the current permutation
> (which it shares out to the world via a function):
>

Actually with my version, if you change the code so it doesn't build the
list of permutations (change it so it only spits out the current
permutation) and change :: <vector> to :: <simple-object-vector>, it
runs in about 0.05 seconds.


Sent via Deja.com
http://www.deja.com/

• Quick permutations
• From: dauclair@hotmail.com
• Re: Quick permutations
• From: oodl@my-deja.com
• Re: Quick permutations, another entry
• From: dauclair@hotmail.com

• Prev: Dylan SETI group?
• Next: Re: Quick permutations, another entry
• Index(es):
  • Main
  • Thread