codejs/src/leetcode/task-a03.ts at dmn-ts-array-iteration-methods · githubdmn/codejs

Repository navigation

// 6! = 6 * 5 * 4 * 3 * 2 * 1

function fact(n: number): number {

let p = 1;

for (let i = 1; i <= n; i++) {

p *= i;

}

return p;

}

function factRecursive(n: number): number {

//if (n == 1 || n == 0) return 1;

//else return n * factRecursive(n - 1);

return n == 1 || n == 0 ? 1 : n * factRecursive(n - 1);

}

// f1 = 1, f2 = 1, f3 = f1 + f2, f4 = f3 + f2, ....

function fibonacci(n: number): number {

let f1 = 1;

let f2 = 1;

let fn = 0;

for (let i = 0; i < n; i++) {

fn = f1 + f2;

f1 = f2;

f2 = fn;

}

return fn;

}

function fibonacciRec(n: number): number {

if (n < 2) return n;

return fibonacciRec(n - 1) + fibonacciRec(n - 2);

}

function run(): void {

console.log('Task a03');

console.time('Fibonacci');

console.log(fibonacci(5));

console.timeEnd('Fibonacci');

console.time('Fib REC');

console.log(fibonacciRec(7));

console.timeEnd('Fib REC');

}

export default run;