c/dataStructure/栈和队列/栈/链栈/ack.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

#include "stack.h"

int ack (int m, int n)
{
    if (m == 0)
        return n+1;
    else if (n == 0)
        return ack(m-1,1);
    else
        return ack(m-1,ack(m,n-1));
}

int main(void)
{
    int m = 2, n = 1;

    printf("%d\n",ack(m,n));

    return 0;
}