.github/workflows/build.yml

@@ -0,0 +1,27 @@
+# This workflow will do a clean installation of node dependencies, cache/restore them, build the source code and run tests across different versions of node
+# For more information see: https://docs.github.com/en/actions/automating-builds-and-tests/building-and-testing-nodejs
+
+name: Node.js CI
+
+on:
+  push:
+    branches: [ "fourth-edition" ]
+  pull_request:
+    branches: [ "fourth-edition" ]
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    strategy:
+      matrix:
+        node-version: [20.x, 22.x]
+    steps:
+    - uses: actions/checkout@v4
+    - name: Use Node.js ${{ matrix.node-version }}
+      uses: actions/setup-node@v4
+      with:
+        node-version: ${{ matrix.node-version }}
+        cache: 'npm'
+    - run: npm test

README.md

@@ -98,7 +98,7 @@ Book link - second edition:
  - [Brazilian Portuguese version](https://novatec.com.br/livros/estruturas-de-dados-algoritmos-em-javascript/)
 
  Book link - third edition:
- - [Packt](https://www.packtpub.com/web-development/learning-javascript-data-structures-and-algorithms-third-edition)
+ - [Packt](https://www.packtpub.com/en-us/product/learning-javascript-data-structures-and-algorithms-9781788624947)
  - [Amazon](http://a.co/cbMlYmJ)
  - [Chinese version](http://www.ituring.com.cn/book/2653)
  - [Brazilian Portuguese version](https://novatec.com.br/livros/estruturas-de-dados-algoritmos-em-javascript-2ed/)

examples/chapter09/04-Fibonacci.js

@@ -30,7 +30,7 @@ function fibonacciMemoization(n) {
   const memo = [0, 1];
   const fibonacci = (n) => {
     if (memo[n] != null) return memo[n];
-    return memo[n] = fibonacci(n - 1, memo) + fibonacci(n - 2, memo);
+    return memo[n] = fibonacci(n - 1) + fibonacci(n - 2);
   };
   return fibonacci(n);
 }