Recursion java modified Fibonacci

Question

public class ModFib
{
    public static int modFibonacci(int term)
    {
        if(term == 1)
        {
            return 3;
        }
        else if(term == 2)
        {
            return 5;
        }
        else
        {
            return modFibonacci(term - 1) + modFibonacci(term - 2) + modFibonacci(term - 3);
        }
    }
}

it works fine at only term - 3 but this gives a stack overflow error.

"it works fine at only term - 3 but this gives a stack overflow error." can you rephrase that a bit clearer please — Bango
– Bango, Commented Mar 17, 2017 at 7:56
once you hit term = 3, you recursivly end up with modFibonacci(3-3), which will end in an endless recursion, as your break condition wont ever be met again, as term wont ever get to be 1 or 2 again and you´ll endlessly end up the in the else part recursivly calling your method. — SomeJavaGuy
– SomeJavaGuy, Commented Mar 17, 2017 at 7:56
@Bango Sorry for lack of clarity. return modFibonacci(term - 1) + modFibonacci(term - 2) works fine but when i add the third term it stops working. — Conor Naughton
– Conor Naughton, Commented Mar 17, 2017 at 7:57

rathna · Accepted Answer · 2017-03-17 08:02:30Z

2

need to add condition like

if(term == 0)
    {
        return 0;
    }

answered Mar 17, 2017 at 8:02

rathna

1,0832 gold badges11 silver badges24 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Recursion java modified Fibonacci

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related