Ackerman Function with ANSI C compilator

[Some days are better than others]

Ackerman Function with ANSI C compilator

I need to solve an Ackerman using the ANSI C.
The function is:

F(0,0,y)=y

F(0,x,y)=F(0,x-1,y)+1 per x diverso da 0

F(1,0,y)=0

F(z,0,y)=1 per z diverso da 0,1

F(z,x,y)=F(z-1,F(z,x-1,y),y) per x,z diversi da 0




other define:

A(0,j)= j+1 j>0

A(i,0)= A(i-1,1) i>0

A(i,j)= A(i+1),A(i,j-1) i,j>0




Could you help me??

THANKS!!!

 

[Alf P. Steinbach]

* Some days are better than others:

I need to solve an Ackerman using the ANSI C.

You have already posted this exact question in
[alt.comp.lang.learn.c-c++], and you've get a perfect answer
there.

DO NOT MULTI-POST.

If you absolutely feel you must post the same article to several
groups, then cross-post, and make sure all groups are relevant.

If you don't understand that, then use _at most_ one group per
article.

That aside, you might want to look at

<url: http://home.no.net/alfps/root/technical/ackermann/analysis.html>

Hth.,

- Alf

 

[Karl Heinz Buchegger]

That aside, you might want to look at

<url: http://home.no.net/alfps/root/technical/ackermann/analysis.html>

Nice and interesting piece of work.
It answered exactly the question I always had.

 

[Alf P. Steinbach]

* Karl Heinz Buchegger:

Nice and interesting piece of work.
It answered exactly the question I always had.

Well, it's an old page: lots of extranous blank lines in Firefox.

But glad it could be useful.

[Sentencing myself to severe punishment, such as physical activity,
for writing off-topic comment.]