tag:blogger.com,1999:blog-5894839.post8545296048124919678..comments2023-10-03T18:59:20.162+02:00Comments on Kazimir Majorinc's Blog (currently not in use): Crawler Tractor.Kazimir Majorinchttp://www.blogger.com/profile/03407339997157446200noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-5894839.post-80755961365711129562013-11-06T20:11:05.484+01:002013-11-06T20:11:05.484+01:00Brilliant, Joel!Brilliant, Joel!Kazimir Majorinchttp://kazimirmajorinc.comnoreply@blogger.comtag:blogger.com,1999:blog-5894839.post-88894496711950288442013-01-17T23:16:59.847+01:002013-01-17T23:16:59.847+01:00And another one, where the list to be pushed is mo...And another one, where the list to be pushed is modified instead of using variables.<br />http://pastebin.com/HdQ8hiyxJoel Ericsonhttps://www.blogger.com/profile/11068804453027195846noreply@blogger.comtag:blogger.com,1999:blog-5894839.post-13529401967002908582013-01-17T16:49:02.883+01:002013-01-17T16:49:02.883+01:00Very nice indeed!
I made a "crawling" fa...Very nice indeed!<br />I made a "crawling" factorial function, just as a proof of concept.<br /><br /><br />(define (f:f y) <br /> (begin<br /> (setq f:n 1)<br /> (setq f:current 0)<br /> (push <br /> '(if (> y 1) <br /> (begin <br /> (inc f:current)<br /> (setq f:n (* f:n y))<br /> (dec y) <br /> (if (and (> (length f:f) 3) (> f:current 2))<br /> (pop f:f 2))<br /> (push (last f:f) f:f -1))<br /> f:n)<br /> f:f -1)))<br /><br />Joel Ericsonhttps://www.blogger.com/profile/11068804453027195846noreply@blogger.comtag:blogger.com,1999:blog-5894839.post-13982483332981673762011-10-01T07:44:30.902+02:002011-10-01T07:44:30.902+02:00Just evaluated this 12996734 is like 30 seconds. V...Just evaluated this 12996734 is like 30 seconds. Very interesting little piece of code. Thanks for sharing.Carloshttp://ekosdeux.comnoreply@blogger.com