What’s your alternative solution? Challenge #16

About this series

This is series of daily JavaScript coding challenges... for both beginners and advanced users.

Each day I’m gone present you a very simple coding challenge, together with the solution. The solution is intentionally written in a didactic way using classic JavaScript syntax in order to be accessible to coders of all levels.

Solutions are designed with increase level of complexity.

Today’s coding challenge

Print the first 10 Fibonacci numbers without recursion

(scroll down for solution)

Code newbies

If you are a code newbie, try to work on the solution on your own. After you finish it, or if you need help, please consult the provided solution.

Advanced developers

Please provide alternative solutions in the comments below.

You can solve it using functional concepts or solve it using a different algorithm... or just solve it using the latest ES innovations.

By providing a new solution you can show code newbies different ways to solve the same problem.

Solution

// Solution for challenge14

var f0 = 0;
println(f0);

var f1 = 1;
println(f1);

for(var i = 2; i < 10; i++)
{
    var fi = f1 + f0;
    println(fi);

    f0 = f1;
    f1 = fi;
}

To quickly verify this solution, copy the code above in this coding editor and press "Run".

Note: The solution was originally designed for codeguppy.com environment, and therefore is making use of println. This is the almost equivalent of console.log in other environments. Please feel free to use your preferred coding playground / environment when implementing your solution.

Comments

[Pierre Bouillon]

May I suggest a recursive version with a cache ? I don't know if this is a huge improvement in this case but 🤷

function fibonacci (index) {

    cache = [0, 1]

    function eval_fib_rank (rank) {
        return rank in cache
            ? cache[rank]
            : cache[rank] = eval_fib_rank(rank - 1) + eval_fib_rank(rank - 2)
    }

    eval_fib_rank(index);

    return cache;
}

console.log(fibonacci (9))