Factorial and nth term of fibonacci by recursion.

 package com.company;

public class CWR_Gfg_Recursion2 {
    //    Factorial of a number n using tail recursion
    public static int factorial(int n, int k) {
        if (n == 0 ) {  // Base case
            return k;
        }
        return factorial(n - 1, n * k);
    }

    //    n-th fibonacci number n>=0
    public static int fibonacci(int a, int b, int n) {
        if (n == 0) {
            return a;
        }
//        System.out.print(a + " ");
       return fibonacci(b, a + b, n - 1);

    }
//    FInd the nth fibonacci number recursively
    public static int fib(int n){
        if(n==0){
            return 0;
        }
        if( n==1){
            return 1;
        }
        return fib(n-1) + fib(n-2);
    }

    public static void main(String[] args) {
        System.out.println(factorial(5, 1));
        System.out.println(fibonacci(0, 1, 4));
        System.out.println(fib(4));
    }
}