Write a program that will trace how Fibonacci numbers are generated recursively

Question

Write a program that will trace how Fibonacci numbers are generated recursively (for any N) and display the trace in the following way :

Example (N=4):

Entering level 0
        Entering level 2
                Entering level 4
                Exiting level 4
            Entering level 3
            Exiting level 3
        Exiting level 2
    Entering level 1
            Entering level 3
            Exiting level 3
        Entering level 2
                Entering level 4
                Exiting level 4
            Entering level 3
            Exiting level 3
        Exiting level 2
    Exiting level 1
Exiting level 0

Explanation / Answer

MY MAIN CLASS

public class Mainclass {

public static void main (string[ ] args) {

int n;
int level=0;

  maincls fibonacci= new maincls();

System.out.println("Enter a number up to which Fibonacci series to print: ");

n = keyboard.nextInt();
System.out.println("Fibonacci trace of: " + n);

fibonacci.trace(n,level);

MY CLASS

package main;
public class maincls{
int fibequ;
public maincls()   
{
}
public int trace(int t, int level)
{

//user has to know which level he is entering

System.out.println("Now entering level " + level);

//If (t<=1) returns the value

if (t<=1)
{
System.out.println (" Now exiting level " + level);
return t;

}

// Else use recurssion for febonacci sequence and determine the level

else
{
fibequ = trace(t-2, level+2) + trace(t-1, level+1);
System.out.println (" Now exiting level " + level);
return t;
}
}
}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.