Write a function named fib that takes an argument n. Assume that n is a number.
Return n number of numbers in an array of the fibonacci sequence
the fibonacci sequence is [0, 1, 1, 2, 3, 5, 8, 13, 21, 34 ...]
var arr = [1, 2, 3]
//last
arr[length-1] = arr[3-1] = arr[2]
//second to last
arr[length-2] = arr[3-2] = arr[1]
// 0 -> []
// 1 -> [0]
// 2 -> [0,1]
// 3 -> [0, 1, 1]
// 6 -> [0, 1, 1, 2, 3, 5]
function fib(n){ // n=3
if (n==0) return [];
if (n==1) return [0];
if (n==2) return [0,1];
var fibList = [0, 1]; // [0,1, 1]
for (var i=2; i<n; i++){
var last = fibList[fibList.length-1];
var secondToLast = fibList[fibList.length-2];
fibList.push(last + secondToLast);
}
return fibList;
}