programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
• Campbell Ritchie
• Liutauras Vilda
• Bear Bibeault
• Jeanne Boyarsky
• Tim Cooke
Sheriffs:
• Knute Snortum
• Junilu Lacar
• Devaka Cooray
Saloon Keepers:
• Ganesh Patekar
• Tim Moores
• Carey Brown
• Stephan van Hulst
• salvin francis
Bartenders:
• Ron McLeod
• Frits Walraven
• Pete Letkeman

# Implementing recursive relations

Greenhorn
Posts: 13
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

Ranch Hand
Posts: 1272
A Java method can call itself without any special syntax.

Please show us the code you have so far.

Ranch Hand
Posts: 7729
But it may be that an iterative solution would be more computationally efficient?

Mike Gershman
Ranch Hand
Posts: 1272

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

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

Mark Rem
Greenhorn
Posts: 13
I don't even know how to get started..

Mike Gershman
Ranch Hand
Posts: 1272
I'll gve you an example:

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

Mike Gershman
Ranch Hand
Posts: 1272
I'll gve you an example:

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

 Don't get me started about those stupid light bulbs.