This post will list all of the corrections or clarifications that have been found in the 1st edition of the Absolute Beginner’s Guide: Data Structures and Algorithms book! :slight_smile: Iterative Binary Search has an undefined right variable Recursive Binary Search Code is Missing Return Stat…

Iterative Binary Search has an undefined right variable The correct version is: // Iterative Approach function binarySearch(arr, val) { let start = 0; let end = arr.length - 1; while (start <= end) { let middleIndex = Math.floor((start + end) / 2); if (arr[middleIndex] === val) { …

Recursive Binary Search Code is Missing Return Statements The correct version is here: // Recursive Approach function binarySearch(arr, val, start = 0, end = arr.length - 1) { const middleIndex = Math.floor((start + end) / 2); if (val === arr[middleIndex]) { return middleIndex; } if …

Insertion Sort - Fixed undeclared j variable The following code declares the j variable correctly to avoid any out-of-scope errors: function insertionSort(input) { // Variable to store the current element being compared let activeNumber; // Loop through the array starting from the second el…

LinkedList - remove and addAfter methods do not properly update the tail pointer Huge thanks to @timfrobisher for pointing this out! The corrected form of this code can be seen here: kirupa/data_structures_algorithms/linkedlist.htm at master · kirupa/kirupa · GitHub Full code pasted below: class …

Binary Tree Traversal code has two mistakes: In breadthFirstTraversal, the line observed.enqueue(root) should be discovered.enqueue(root) In depthFirstTraversal, if you are using the Stack implementation from the book as opposed to including the one from kirupa.com , you will be missing the len…

Hello, I have reviewed 13. Graphs code: class Graph { constructor() { // Map to store nodes and their adjacent nodes this.nodes = new Map(); // Flag to indicate if the graph is directed or undirected this.isDirected = false; } // Add a new node to the graph…

Do you have an example where the original version doesn’t work? I spent some time trying out different Graph examples, and both your version and the book’s original version returned the same results. You can see my file here: kirupa/data_structures_algorithms/graph.htm at master · kirupa/kirupa · G…

In your kirupa/data_structures_algorithms/graph.htm at c23b48bcda4b8a8497139c51e709379cae54c62b · kirupa/kirupa · GitHub removeNode(nodeToRemove) { if (this.nodes.has(nodeToRemove)) { // Remove the node and its edges from the graph this.nodes.delete(nodeToR…

Hi @anlexN - you are right. It required me to sleep and wake up today and see it with a fresher perspective :stuck_out_tongue: In what I had originally, instead of removing references to the deleted node, I’m removing self-references (which don’t exist anyway). It should be as you described earlier…

when do you publish a new version book?

Errata: Data Structures and Algorithms Book!

programming

Topic		Replies	Views
Two Bugs in LinkedList data structure in Absolute Beginner's Guide to Algorithms Uncategorized	7	646	February 24, 2024
found a bug in Absolute Beginner’s Guide to Algorithms programming	1	471	December 15, 2023
Bug in Insertion Sort Code programming	1	425	December 16, 2023
mistakes in Absolute Beginner's guide 2nd Edition programming	6	546	March 7, 2022
Next book (and tutorial topic): Data Structures and Algorithms programming	18	1804	January 24, 2024

Errata: Data Structures and Algorithms Book!

Follow:

Popular

Loose Ends

Errata: Data Structures and Algorithms Book!

Related topics

Follow:

Popular

Loose Ends