On Thu, May 16, 2013 at 04:33:49PM +0200, Alexander Burger wrote:
> > though the less-recursive function is slightly slower (as expected).
>
> Oops, forget that! Not "as expected" ... the opposite would be expected.
> But the values are very close anyway.
One more oops!!
Though it doesn't matter much for the speed, I just noticed that 'ack2'
was wrong! It recursed on 'ack' instead of itself ('ack2').
So for the records, this is the corrected version:
(de ack2 (M N)
(loop
(T (=0 M) (inc N))
(NIL (=0 N) (ack2 (dec M) (ack2 M (dec N))))
(dec 'M)
(one N) ) )
♪♫ Alex
--
UNSUBSCRIBE: mailto:[email protected]?subject=Unsubscribe
