Fix array indices starting from 2

algorithms-in-action · Jan 19, 2025 · afa551a · afa551a
1 parent bd035f5
commit afa551a
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 6 deletions.
diff --git a/src/algorithms/controllers/HashingInsertion.js b/src/algorithms/controllers/HashingInsertion.js
@@ -1,7 +1,7 @@
-// XXX could probably do with a restructure!
-// Dynamic table size was first implemented in a rather inflexible way wrt what gets
-// animated etc.  The code has been hacked around to "fix" this but it could do with
-// a re-think or at least a clean up!
+// XXX could probably do with a restructure; certainly a clean up!
+// Dynamic table size was first implemented in a rather inflexible way wrt what
+// gets animated etc.  The code has been hacked a lot to "fix" this and a
+// bunch of other things...
 
 import Array2DTracer from '../../components/DataStructures/Array/Array2DTracer';
 import GraphTracer from '../../components/DataStructures/Graph/GraphTracer';

diff --git a/src/components/DataStructures/Array/Array1DRenderer/index.js b/src/components/DataStructures/Array/Array1DRenderer/index.js
@@ -150,8 +150,8 @@ class Array1DRenderer extends Array2DRenderer {
                 style={{ display: 'flex', justifyContent: 'space-between' }}
               >
                 {longestRow.map((_, i) => {
-                  // if the graph instance is heapsort, then the array index starts from 1
-                  i += 1;
+                  // the array index starts from 1 in most algorithms
+                  // 0 for straightRadixSort (wanted for count array)
                   if (algo !== "straightRadixSort") {
                     i += 1;
                   }