728x90
let list = {
value: 1,
next: {
value: 2,
next: {
value: 3,
next: {
value: 4,
next: null
}
}
}
};
function printListReverseLoop(list) {
let cur = list;
const arr = [];
while(cur) {
arr.push(cur.value);
cur = cur.next;
}
for(let i = arr.length - 1; i >= 0; i--) {
console.log(arr[i]);
}
}
function printListReverseRecursion(list) {
if (list.next) {
printListReverseRecursion(list.next);
}
console.log(list.value);
}
printListReverseLoop(list);
printListReverseRecursion(list);
view raw jst_recursionAndStack_5_outputASingleLinkedListReverseOrder.js hosted with ❤ by GitHub
저작자표시

'Algorithm > JavaScript(Node.js)' 카테고리의 다른 글

The Modern JS Tutorial: Variable scope and Closure: Which variables are available  (0) 2021.12.15
The Modern JS Tutorial: Variable scope and Closure: Does a function pick latest changes  (0) 2021.12.15
The Modern JS Tutorial: Recursion and stack: output a single linked-list  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: fibonacci numbers  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Calculate factorial  (0) 2021.12.11
728x90
// loop
function printListLoop(list) {
let cur = list;
while(cur) {
console.log(cur.value);
cur = cur.next;
}
}
// recursion
function printListRecursion(list) {
console.log(list.value);
if (list.next) {
printListRecursion(list.next);
}
}
const list = {
value: 1,
next: {
value: 2,
next: {
value: 3,
next: {
value: 4,
next: null
}
}
}
};
console.log('Loop');
printListLoop(list);
console.log('Recursion');
printListRecursion(list);
view raw jst_recursionAndStack_4_outputASingleLinkedList.js hosted with ❤ by GitHub
저작자표시

'Algorithm > JavaScript(Node.js)' 카테고리의 다른 글

The Modern JS Tutorial: Variable scope and Closure: Does a function pick latest changes  (0) 2021.12.15
The Modern JS Tutorial: Recursion and stack: output a single linked-list reverse order  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: fibonacci numbers  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Calculate factorial  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Sum all numbers till the given one  (0) 2021.12.11
728x90
function fib(n) {
if (n <= 1) {
return n;
}
return fib(n - 1) + fib(n -2);
// or
// return n <= 1 ? n : fib(n - 1) + fib(n - 2);
}
console.log(fib(3)); // 2
console.log(fib(7)); // 13
// console.log(fib(77)); // 5527939700884757(extremely slow!)
function cacheFib(n) {
let a = 1;
let b = 1;
for(let i = 3; i <= n; i++) {
let c = a + b;
a = b;
b = c;
}
return b;
}
console.log(cacheFib(3)); // 2
console.log(cacheFib(7)); // 13
console.log(cacheFib(77)); // 5527939700884757(fast)
view raw jst_recursionAndStack_3_fibonacciNumbers.js hosted with ❤ by GitHub
저작자표시

'Algorithm > JavaScript(Node.js)' 카테고리의 다른 글

The Modern JS Tutorial: Recursion and stack: output a single linked-list reverse order  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: output a single linked-list  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Calculate factorial  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Sum all numbers till the given one  (0) 2021.12.11
The Modern JS Tutorial: JSON methods: Exclude backreferences  (0) 2021.12.07
728x90
function factorial(n) {
if ( n === 1 ) {
return 1;
}
return n * factorial(n - 1);
// or
// return n === 1 ? 1 : n * factorial(n - 1);
// or
// return n !== 1 ? n * factorial(n - 1) : 1;
// or
// return n ? n * factorial(n - 1) : 1;
}
console.log( factorial(5) ); // 120
view raw jst_recursionAndStack_2_calculateFactorial.js hosted with ❤ by GitHub
저작자표시

'Algorithm > JavaScript(Node.js)' 카테고리의 다른 글

The Modern JS Tutorial: Recursion and stack: output a single linked-list  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: fibonacci numbers  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Sum all numbers till the given one  (0) 2021.12.11
The Modern JS Tutorial: JSON methods: Exclude backreferences  (0) 2021.12.07
The Modern JS Tutorial: JSON methods: Turn the object into JSON and back  (0) 2021.12.07
728x90
function sumToFromLoop(n) {
let sum = 0;
for(let i = 0; i <= n; i++) {
sum += i;
}
return sum;
}
function sumToRecursion(n) {
if (n === 1) {
return n;
}
return n + sumToRecursion(n - 1);
}
function sumToFormula(n) {
return n * (n + 1) / 2; // 👍🏻
}
console.log( sumToFromLoop(100) ); // 5050
console.log( sumToRecursion(100) ); // 5050
console.log( sumToFormula(100) ); // 5050
view raw jst_recursionAndStack_1_sumAllNumbersTillTheGivenOne.js hosted with ❤ by GitHub
저작자표시

'Algorithm > JavaScript(Node.js)' 카테고리의 다른 글

The Modern JS Tutorial: Recursion and stack: fibonacci numbers  (0) 2021.12.11
The Modern JS Tutorial: Recursion and stack: Calculate factorial  (0) 2021.12.11
The Modern JS Tutorial: JSON methods: Exclude backreferences  (0) 2021.12.07
The Modern JS Tutorial: JSON methods: Turn the object into JSON and back  (0) 2021.12.07
The Modern JS Tutorial: Date and Time: Format the relative date  (0) 2021.12.06

+ Recent posts

티스토리툴바