Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • 3
    Please, these are really easy with loops, I see them all the time. Heck, with a bit of effort you don't even need the loops. Even if recursion is easier. Commented Nov 24, 2015 at 10:10
  • 1
    actually, A(0,n)=n+1; A(m,0)=A(m-1,1) if m>0; A(m,n) = A(m-1,A(m,n-1)) if m>0,n>0 grows even a bit faster than O(n^n) (for m=n) :) Commented Nov 24, 2015 at 11:31
  • 1
    @JohnDonn More than a bit, it's super exponential. for n=3 n^n^n for n=4 n^n^n^n^n and so on. n to the n power n times. Commented Nov 25, 2015 at 16:25