Implementing recursive relations

[Mark Rem]

I'm fairly new to java and I have this assignment to do? How would i go about doing this?

Implement a program which computes the following recurrence relation:

f(1) = 1; f(2) = 1; f(3) = 1; f(4) = 1; f(5) = 1;

f(n) = f( n - 1 ) + 3 * f( n - 5 ) for all n > 5

Display the results for n = 6, 7, 12, and 15

[Mike Gershman]

A Java method can call itself without any special syntax.

Please show us the code you have so far.

[Barry Gaunt]

But it may be that an iterative solution would be more computationally efficient?

[Mike Gershman]

it may be that an iterative solution would be more computationally efficient

... unless the assignment called for the use of recursion.

[Mark Rem]

I don't even know how to get started..

[Mike Gershman]

I'll gve you an example:

int fibonacci( int i ) { return fibonacci( i - 1 ) + fibonacci( i - 2 ); }

Now deal with the boundary conditions (what if i=1 or i=2?) and also modify the equation to fit your assignment.

[Mike Gershman]

I'll gve you an example:

int fibonacci( int i ) { return fibonacci( i - 1 ) + fibonacci( i - 2 ); }

Now deal with the boundary conditions (what if i=1 or i=2?) and also modify the equation to fit your assignment.