beneroth changed the topic of #picolisp to: PicoLisp language | The scalpel of software development | Channel Log: https://libera.irclog.whitequark.org/picolisp | Check www.picolisp.com for more information
<tankf33der> hi all
<tankf33der> new task is done:
<tankf33der> pi value is correct except last several digits.
<Regenaxer> Does 'cache' make sense for 'fact'? It recurses only once
<tankf33der> will remove
<Regenaxer> or make a 'for' loop if stack is critical
<tankf33der> T
<tankf33der> nasty task, spent several days.
<Regenaxer> yes, looks tricky!
<Regenaxer> What is the shortest way to make a non-recursive factorial in pil?
<tankf33der> For loop
<Regenaxer> indeed
<Regenaxer> With 'apply'
<Regenaxer> 'apply' and 'range' are expensive though. I thought a loop
<Regenaxer> How about this? http://ix.io/3PAi
<Regenaxer> But interesting! The 'apply' version is sill the fastest (if you do (gc 9) before)
<tankf33der> Ok
yagamisa1o has joined #picolisp
aw- has quit [Ping timeout: 240 seconds]
clacke has quit [Remote host closed the connection]
clacke has joined #picolisp