Method main

benchmark/bench/recursive.java:12–24

(String args[])

public class recursive
{
  public static void main(String args[])
  {
    int n = Integer.parseInt(args[0]);

    System.out.printf("Ack(3,%d): %d\n", n, ack(3, n));
    System.out.printf("Fib(%.1f): %.1f\n", 27.0 + n, fib(27.0 + n));

    n -= 1;
    System.out.printf("Tak(%d,%d,%d): %d\n", n * 3, n * 2, n, tak(n * 3, n * 2, n));

    System.out.printf("Fib(3): %d\n", fib(3));
    System.out.printf("Tak(3.0,2.0,1.0): %.1f\n", tak(3.0, 2.0, 1.0));
  }

  public static int ack(int m, int n)
  {