Path: utzoo!attcan!uunet!husc6!bloom-beacon!WHEATIES.AI.MIT.EDU!kranz
From: kranz@WHEATIES.AI.MIT.EDU (David Kranz)
Newsgroups: comp.lang.scheme
Subject: Scheme Digest #8 , Efficiency of Y
Message-ID: <8811151526.AA00789@shredded-wheat.ai.mit.edu>
Date: 15 Nov 88 15:26:46 GMT
References: <8811150617.AA29565@wheaties.ai.mit.edu>
Sender: daemon@bloom-beacon.MIT.EDU
Organization: The Internet
Lines: 15

Edward Wang is correct that the time in the example is dominated by bignum
arithmetic.  I changed the * in factorial to + and got the following result in
T3.1:

(factorial-loop 20000) -> .1 sec

(factorial-rec 20000) -> .22 sec

(factorial-lfp 20000) -> 1.32 sec

With *:

(factorial-rec 100) -> .42 sec

(factorial-rec 1000) -> 57.78 sec