HelloRecursion

public class HelloRecursion
{

public static int fakRec(int n) {
    if (n == 1) return 1;
    return n * fakRec(n-1);
  }

  public static int gdc(int bigger, int smaller) {
    if (smaller == 0) {
      return bigger;
    }
    return gdc(smaller, bigger%smaller);
  }

  public static int fib (int n) {
    if (n==0)
      return 0;

    else if (n==1)
      return 1;

    else
      return fib(n-1) + fib (n-2);
  }

  public static void main(String[] args)
  {
    System.out.println(fakRec(5))
    System.out.println(gdc(10278979%32, 683244%42));

    for (int i = 0; i < 40; i++) {
    System.out.print(fib(i) + " ");
    }

  }
}