• Jeliot Great tool for understanding how recursion works
• TailRecursionJeliot.java ( use this for Jeliot, just copy and paste code directly into Jeliot)
• TailRecursion.java

Recursion is something that calls itself again. Look on at the method 'recurse()' below. The bottom block is the recursive part and the top block is the 'base case.' The 'base case' is what ensures that your code will, eventually stop!

The Tower of Hanoi

  public int factorial(int num)
    {
        int r = 1;
        for( int i= 1;i <= num ;i++)
           r *= i;

    return r;
    }
    
    

How would you rewrite this using recursion?

    public int factorialRecursive(int n){
    if(n ==1)
        return 1;
    else
        return (n) * factorialRecursive(n-1) ;
    
    }