This is how you properly calculate an element from the Fibonacci sequence in JavaScript:

function fibonacci(n) {
const phi = (1+Math.sqrt(5))/2;
return Math.round((phi**(n) - (-phi)**(-n))/(2*phi-1));
}

fibonacci(1000)

This is much faster than your recursive Rust solution! That means JS is faster than Rust!

#rust #javascript