Fibonacci function without recursion

function fibonacci(N) {

if (N <= 2) {

return 1;

}

let a = 1; // N - 2

let b = 1; // N - 1

let result;

for (let i = 3; i <= N; i++) {

result = a + b;

a = b;

b = result;

}

return result;

}