Re: general algorithm + ackermann question

* jason.s.turner@xxxxxxxxx:
Hi, I am working on an assignment and I'm a bit confused and stuck.

I am to write an Ackermann function using recursion which was no
problem and dynamic version as well. The dynamic version is giving me
crap.

Possibly what's meant by "dynamic" version is a version that doesn't recompute earlier results of subcomputations.

The trick is then to determine which subcomputation results will also be needed later, and store these results.

Perhaps <url: http://home.no.net/alfps/root/technical/ackermann/analysis.html> can be of help.


Cheers, & hth.,

- Alf

--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?
.