help needed with recursive fibonacci

Please support our Java advertiser: Programming Forums - DaniWeb Sister Site
Reply

•
•
Join Date: Oct 2004
Posts: 26
Reputation: SyLk is an unknown quantity at this point 
Solved Threads: 0
SyLk SyLk is offline Offline
Light Poster

help needed with recursive fibonacci

 
0
  #1
Sep 14th, 2008
Im attemtping to return the next value in this suequence recursively 1, 4, 11, 34, 101
this is what i've done thus far, im not sure how to pass this list to the function to compute the next value which i believe to be 304. can some explain how i shoud write the main.
also in cases where the nth-1 value etc is needed how do you go about getting these list to the method

Thank you guys.




Java Syntax (Toggle Plain Text) 
  1.  
  2. public static int fibo(int nthfibo)
  3.  {
  4.       if (nthfibo == 1)
  5.         return 1;
  6.       else if (nthfibo != 1 && nthfibo % 2 ==0)
  7.        {
  8.           return fibo(nthfibo) *3-1;
  9.         }
  10.        else
  11.        {
  12.           return fibo(nthfibo)*3+1;	
  13.         }
  14.  
  15.   }
Reply With Quote Quick reply to this message  
•
•
Join Date: Jan 2008
Posts: 3,832
Reputation: VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute 
Solved Threads: 501
Featured Poster
VernonDozier VernonDozier is offline Offline
Senior Poster

Re: help needed with recursive fibonacci

 
0
  #2
Sep 14th, 2008
One, multiplying by 3, then adding or subtracting 1 isn't the Fibonacci sequence. Two, I don't see the need for recursion here. What exactly is this function supposed to do? If it simply takes a number in the sequence and returns the next number in the sequence, there is no need for recursion. fibo(101) is supposed to return 304, right?

What list are you referring to? A list of all the numbers in the sequence which are less than or equal to 101?
Reply With Quote Quick reply to this message  
•
•
Join Date: Oct 2004
Posts: 26
Reputation: SyLk is an unknown quantity at this point 
Solved Threads: 0
SyLk SyLk is offline Offline
Light Poster

Re: help needed with recursive fibonacci

 
0
  #3
Sep 14th, 2008
1. the reason for me doing it recursively is because its an exercise in recursion.
2. after looking at the sequence of numbers i determined that 1 was the base case.
and if the position of the nth number was even it would multiply the previos number by 3 and subtract 1 if the position of the nth number was odd it would multiply by 3 and add 1.
the assignment was simply to create the method as i have done ( i believe).
in addition to this i wanted to write the program to see the function work....that im not sure how to do it.

the list im referring to is the list of numbers 1, 4 , 11, 34, 101.
I am simply tryin to create a recursive program to find the 6th integer in this list.

Thanks
Reply With Quote Quick reply to this message  
•
•
Join Date: Jan 2008
Posts: 3,832
Reputation: VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute VernonDozier has a reputation beyond repute 
Solved Threads: 501
Featured Poster
VernonDozier VernonDozier is offline Offline
Senior Poster

Re: help needed with recursive fibonacci

 
0
  #4
Sep 14th, 2008
•
•
•
•
Originally Posted by SyLk View Post
1. the reason for me doing it recursively is because its an exercise in recursion.
2. after looking at the sequence of numbers i determined that 1 was the base case.
and if the position of the nth number was even it would multiply the previos number by 3 and subtract 1 if the position of the nth number was odd it would multiply by 3 and add 1.
the assignment was simply to create the method as i have done ( i believe).
in addition to this i wanted to write the program to see the function work....that im not sure how to do it.

the list im referring to is the list of numbers 1, 4 , 11, 34, 101.
I am simply tryin to create a recursive program to find the 6th integer in this list.

Thanks
Then I'd say you want to pass the function n , not nthfibo .
What kind of List are you going to use? It's a matter of personal preference, but I like Vector. You could make this your function:

Java Syntax (Toggle Plain Text) 
  1. public static void fibo(Vector <Integer> numbers, int n)

If you're going to have a Vector, you'll need to pass fibo the Vector each recursive call, so you might as well have it be a void function. So if you passed it an empty Vector, the following call:

Java Syntax (Toggle Plain Text) 
  1. fibo (numbers, 6);

could result in numbers holding {1, 4, 11, 34, 101, 304}. Is that what you're looking for? I'd rename the function though.

•
•
•
•
I am simply trying to create a recursive program to find the 6th integer in this list.
So you do want the whole List, right, not just the 6th element?
Reply With Quote Quick reply to this message  
Reply

Quick Reply to Thread
This thread is more than three months old.
Perhaps start a new thread instead?
•
•
•
•
•
•
•
•
Message:
•
•
•
•



Other Threads in the Java Forum
Thread Tools Search this Thread



911 actionlistener addressbook android api append applet application array arrays automation binary bluetooth character chat class classes client code component consumer csv database desktop draw eclipse error event exception fractal ftp game givemetehcodez graphics gui html ide image input integer j2me japplet java javaarraylist javaee javaprojects jmf jni jpanel julia linked linux list loop mac map method methods mobile netbeans newbie objects online oracle oriented panel print printf problem program programming project projects properties recursion replaydirector reporting researchinmotion robot rotatetext rsa scanner screen se server set size sms sort sql string swing template test threads time tree ubuntu windows working
About Us | Contact Us | Advertise | DaniWeb | Acceptable Use Policy | RSS Feed

©2003 - 2009 DaniWeb® LLC