Printing the n-th Fibonacci number using a for-loop










-2















I wrote this program using return but would like the program to do the exact same thing only using the run-method and a for-loop. It should print the n-th number in the Fibonacci sequence.



import acm.program.*;


public class TESTfibonacci extends ConsoleProgram

public void run()

long n = readInt("Enter a number: ");
println(fibo(n));


// Prints the n-th Fibonacci number.
long fibo(long n)
if (n == 0)
return 0;
else if (n <= 2)
return 1;
else
return fibo(n - 2) + fibo(n - 1);












share|improve this question
























  • What have you tried so far?

    – MTCoster
    Nov 15 '18 at 18:29






  • 2





    Try searching for fibonacci iteration java.

    – A Boschman
    Nov 15 '18 at 18:30






  • 1





    What have you tried and what are you having trouble with? I assume you have done a quick search of the many solutions to this problem.

    – Peter Lawrey
    Nov 15 '18 at 19:01















-2















I wrote this program using return but would like the program to do the exact same thing only using the run-method and a for-loop. It should print the n-th number in the Fibonacci sequence.



import acm.program.*;


public class TESTfibonacci extends ConsoleProgram

public void run()

long n = readInt("Enter a number: ");
println(fibo(n));


// Prints the n-th Fibonacci number.
long fibo(long n)
if (n == 0)
return 0;
else if (n <= 2)
return 1;
else
return fibo(n - 2) + fibo(n - 1);












share|improve this question
























  • What have you tried so far?

    – MTCoster
    Nov 15 '18 at 18:29






  • 2





    Try searching for fibonacci iteration java.

    – A Boschman
    Nov 15 '18 at 18:30






  • 1





    What have you tried and what are you having trouble with? I assume you have done a quick search of the many solutions to this problem.

    – Peter Lawrey
    Nov 15 '18 at 19:01













-2












-2








-2








I wrote this program using return but would like the program to do the exact same thing only using the run-method and a for-loop. It should print the n-th number in the Fibonacci sequence.



import acm.program.*;


public class TESTfibonacci extends ConsoleProgram

public void run()

long n = readInt("Enter a number: ");
println(fibo(n));


// Prints the n-th Fibonacci number.
long fibo(long n)
if (n == 0)
return 0;
else if (n <= 2)
return 1;
else
return fibo(n - 2) + fibo(n - 1);












share|improve this question
















I wrote this program using return but would like the program to do the exact same thing only using the run-method and a for-loop. It should print the n-th number in the Fibonacci sequence.



import acm.program.*;


public class TESTfibonacci extends ConsoleProgram

public void run()

long n = readInt("Enter a number: ");
println(fibo(n));


// Prints the n-th Fibonacci number.
long fibo(long n)
if (n == 0)
return 0;
else if (n <= 2)
return 1;
else
return fibo(n - 2) + fibo(n - 1);









java fibonacci






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 15 '18 at 18:36









Bandi Kishore

3,5011830




3,5011830










asked Nov 15 '18 at 18:24









JohnJohn

11




11












  • What have you tried so far?

    – MTCoster
    Nov 15 '18 at 18:29






  • 2





    Try searching for fibonacci iteration java.

    – A Boschman
    Nov 15 '18 at 18:30






  • 1





    What have you tried and what are you having trouble with? I assume you have done a quick search of the many solutions to this problem.

    – Peter Lawrey
    Nov 15 '18 at 19:01

















  • What have you tried so far?

    – MTCoster
    Nov 15 '18 at 18:29






  • 2





    Try searching for fibonacci iteration java.

    – A Boschman
    Nov 15 '18 at 18:30






  • 1





    What have you tried and what are you having trouble with? I assume you have done a quick search of the many solutions to this problem.

    – Peter Lawrey
    Nov 15 '18 at 19:01
















What have you tried so far?

– MTCoster
Nov 15 '18 at 18:29





What have you tried so far?

– MTCoster
Nov 15 '18 at 18:29




2




2





Try searching for fibonacci iteration java.

– A Boschman
Nov 15 '18 at 18:30





Try searching for fibonacci iteration java.

– A Boschman
Nov 15 '18 at 18:30




1




1





What have you tried and what are you having trouble with? I assume you have done a quick search of the many solutions to this problem.

– Peter Lawrey
Nov 15 '18 at 19:01





What have you tried and what are you having trouble with? I assume you have done a quick search of the many solutions to this problem.

– Peter Lawrey
Nov 15 '18 at 19:01












1 Answer
1






active

oldest

votes


















0














you can use dynamic programming for this. The code is taken from here



class Fibonacci 
static int fib(int n)
/* Declare an array to store Fibonacci numbers. */
int f = new int[n + 2]; // 1 extra to handle case, n = 0
int i;

/* 0th and 1st number of the series are 0 and 1*/
f[0] = 0;
f[1] = 1;

for (i = 2; i <= n; i++)
/* Add the previous 2 numbers in the series
and store it */
f[i] = f[i - 1] + f[i - 2];


return f[n];


public static void main(String args)
int n = 9;
System.out.println(fib(n));







share|improve this answer






















    Your Answer






    StackExchange.ifUsing("editor", function ()
    StackExchange.using("externalEditor", function ()
    StackExchange.using("snippets", function ()
    StackExchange.snippets.init();
    );
    );
    , "code-snippets");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "1"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53325725%2fprinting-the-n-th-fibonacci-number-using-a-for-loop%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    you can use dynamic programming for this. The code is taken from here



    class Fibonacci 
    static int fib(int n)
    /* Declare an array to store Fibonacci numbers. */
    int f = new int[n + 2]; // 1 extra to handle case, n = 0
    int i;

    /* 0th and 1st number of the series are 0 and 1*/
    f[0] = 0;
    f[1] = 1;

    for (i = 2; i <= n; i++)
    /* Add the previous 2 numbers in the series
    and store it */
    f[i] = f[i - 1] + f[i - 2];


    return f[n];


    public static void main(String args)
    int n = 9;
    System.out.println(fib(n));







    share|improve this answer



























      0














      you can use dynamic programming for this. The code is taken from here



      class Fibonacci 
      static int fib(int n)
      /* Declare an array to store Fibonacci numbers. */
      int f = new int[n + 2]; // 1 extra to handle case, n = 0
      int i;

      /* 0th and 1st number of the series are 0 and 1*/
      f[0] = 0;
      f[1] = 1;

      for (i = 2; i <= n; i++)
      /* Add the previous 2 numbers in the series
      and store it */
      f[i] = f[i - 1] + f[i - 2];


      return f[n];


      public static void main(String args)
      int n = 9;
      System.out.println(fib(n));







      share|improve this answer

























        0












        0








        0







        you can use dynamic programming for this. The code is taken from here



        class Fibonacci 
        static int fib(int n)
        /* Declare an array to store Fibonacci numbers. */
        int f = new int[n + 2]; // 1 extra to handle case, n = 0
        int i;

        /* 0th and 1st number of the series are 0 and 1*/
        f[0] = 0;
        f[1] = 1;

        for (i = 2; i <= n; i++)
        /* Add the previous 2 numbers in the series
        and store it */
        f[i] = f[i - 1] + f[i - 2];


        return f[n];


        public static void main(String args)
        int n = 9;
        System.out.println(fib(n));







        share|improve this answer













        you can use dynamic programming for this. The code is taken from here



        class Fibonacci 
        static int fib(int n)
        /* Declare an array to store Fibonacci numbers. */
        int f = new int[n + 2]; // 1 extra to handle case, n = 0
        int i;

        /* 0th and 1st number of the series are 0 and 1*/
        f[0] = 0;
        f[1] = 1;

        for (i = 2; i <= n; i++)
        /* Add the previous 2 numbers in the series
        and store it */
        f[i] = f[i - 1] + f[i - 2];


        return f[n];


        public static void main(String args)
        int n = 9;
        System.out.println(fib(n));








        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered Nov 15 '18 at 19:05









        Marko VranjkovicMarko Vranjkovic

        2,68022946




        2,68022946





























            draft saved

            draft discarded
















































            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53325725%2fprinting-the-n-th-fibonacci-number-using-a-for-loop%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Top Tejano songwriter Luis Silva dead of heart attack at 64

            ReactJS Fetched API data displays live - need Data displayed static

            政党