// Ackermann function benchmark - deep recursion
const std = @import("std");

fn ackermann(m: i64, n: i64) i64 {
    if (m == 0) return n + 1;
    if (n == 0) return ackermann(m - 1, 1);
    return ackermann(m - 1, ackermann(m, n - 1));
}

pub fn main() void {
    const result = ackermann(3, 10);
    std.debug.print("ackermann(3, 10) = {d}\n", .{result});
}