Search:

Type: Posts; User: GoodbyeWorld

Search: Search took 0.22 seconds.

  1. Replies
    5
    Views
    1,608

    Re: Recursion: Fibonacci Number Question

    for(n = 40; n < 50; n++ )
    {
    ...........

    }
  2. Replies
    5
    Views
    1,608

    Re: Recursion: Fibonacci Number Question

    F(n) = F(n-1) + F(n-2);

    F(0) = 0;
    F(1) = 1;


    At which value of n?

    add a throws clause (throws InputMismatchException) to your two methods (rfib and memorized).
Results 1 to 2 of 2