Re: LOGO-L> Factorials

[Yehuda Katz <yehuka@beitberl.beitberl.ac.il>]

George Mills wrote:
> 
> Changing to FOR may be a tad slower than REPEAT but the bulk of
> the time is now simply fetching the correct precalculated value from
> the "factorial cache".

If speed is the main concern, maybe it would be better to calculate the
factorials by an iterative procedure instead of a recursive one. You
might want to check this.

Instead of using an array, I tried creating a *list* of those 10
factorials. It appears that the list gave slower performance, but that's
only my impression.

> If things were real large and less predicatable you can also Fill
> the "cache" on demand. You do this by "tagging" each entry as to
> its validity.

How you do that?

> Since now you won't be needing the P266 I'll give you an address
> you can forward it to :-).

I'll consider you generous offer, but then - how shall I be able to
redraw FAST those graphics on my screen?

[[Yehuda]]

---------------------------------------------------------------
Please post messages to the Logo forum to logo-l@gsn.org.  Mail
questions about the list administration to logofdn@gsn.org.  To
unsubscribe send    unsubscribe logo-l    to majordomo@gsn.org.