js: naive fib

naivefib.js

// naive fibs with memoization

function fib(n, acc) {
	if(n >= 1) {
		if(acc[n]) {
			return acc[n];
		} else {
			acc[n] = fib(n - 1, acc) + fib(n - 2, acc);
			return acc[n];
		}
	} else {
		return 1;
	}
}

function fib(n, acc) {
	return 
	n >= 1 ? acc[n] ? acc[n] : acc[n] = fib(n - 1, acc) + fib(n - 2, acc) : 1;
}