Rosetta Code Popular

Ackermann Function

Run the Ackermann function on small inputs to show deep recursion.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/ackermann_function.vibe
def ackermann(m: int, n: int) -> int
  if m == 0
    n + 1
  elsif n == 0
    ackermann(m - 1, 1)
  else
    ackermann(m - 1, ackermann(m, n - 1))
  end
end

def run -> { a_0_0: int, a_2_2: int, a_3_2: int }
  {
    a_0_0: ackermann(0, 0),
    a_2_2: ackermann(2, 2),
    a_3_2: ackermann(3, 2)
  }
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.