Results 1 to 2 of 2

Thread: Fibonacci Functions and Sets (+Java)

  1. #1
    Oct 2012

    Fibonacci Functions and Sets (+Java)

    I would like some help getting through these 2 problems:

    Implement all three methods we discussed for computing a given element F_n the Fibonacci sequence: F_0 = F_1 = 1. F_k = F_k-1 + F_k-2 for k > 1.
    1. Recursive (write a recursive function to compute F_n given input n)
    2. Inductive (compute F_0, , F_n in order)
    3. Formula (compute F_n directly using the formula we derived, also on pg. 323)
    Compare each of these methods on a range of n values. What do you conclude? Which method is fastest, uses the least memory, easiest to implement?

    Implement your own Set class in Java for storing sets of integers (note: Java has a built-in set class, but you should not use it). Your class should support the following basic set operations: union, intersection, difference. Demonstrate your class works on some example operations and discuss how efficient your implementation is.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Jan 2008

    Re: Fibonacci Functions and Sets (+Java)

    What have you done so far?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 0
    Last Post: September 6th 2012, 12:41 AM
  2. Java Blue J
    Posted in the Math Software Forum
    Replies: 4
    Last Post: September 5th 2010, 11:28 AM
  3. Replies: 3
    Last Post: February 20th 2010, 11:58 PM
  4. Another Java Program
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: November 2nd 2006, 01:23 PM
  5. More Java Help
    Posted in the Advanced Math Topics Forum
    Replies: 1
    Last Post: October 27th 2006, 07:45 PM

Search Tags

/mathhelpforum @mathhelpforum