fix: hashing search and delete using wrong table size

Author: tuankhainguy

src/algorithms/controllers/HashingCommon.js

@@ -45,6 +45,16 @@ export const PRIMES = [
   11, 23, 47, 97
 ];
 
+// find the table size from the table extracted from the visualizer
+export function findTableSize(table) {
+  for (let i = 0; i < PRIMES.length; i++) {
+    if (table.length - PRIMES[i] < SPLIT_SIZE) {
+      return PRIMES[i];
+    }
+  }
+  return 0;
+}
+
 // which table size in PRIMES array to allow pointer
 export const POINTER_CUT_OFF = 1;
 

src/algorithms/controllers/HashingDelete.js

@@ -39,7 +39,7 @@ export default function HashingDelete(
 
   // Assigning parameter values to local variables
   const ALGORITHM_NAME = params.name;
-  const SIZE = params.hashSize; // Hash Modulo being used in the table
+  const SIZE = table.length; // Hash Modulo being used in the table
 
   // Chunker for intial state of visualizers
   chunker.add(

src/algorithms/controllers/HashingInsertion.js

@@ -157,7 +157,7 @@ export default {
         (vis, idx) => {
 
           // Pointer only appear for small table
-          if (table.length <= PRIMES[POINTER_CUT_OFF]) {
+          if (table.length < PRIMES[POINTER_CUT_OFF]) {
             vis.array.assignVariable(POINTER_VALUE, POINTER, idx);
           }
 
@@ -196,7 +196,7 @@ export default {
           (vis, idx) => {
 
             // Pointer only appears for small tables
-            if (table.length <= PRIMES[POINTER_CUT_OFF]) {
+            if (table.length < PRIMES[POINTER_CUT_OFF]) {
               vis.array.assignVariable(POINTER_VALUE, POINTER, idx);
             }
             vis.array.fill(INDEX, idx, undefined, undefined, Colors.Pending); // Filling the pending slot with yellow
@@ -425,14 +425,14 @@ export default {
         IBookmarks.Init,
         (vis, size, array) => {
           // Increase Array2D visualizer render space
-        if (SIZE === LARGE_SIZE) {
-          vis.array.setSize(3);
-          vis.array.setZoom(0.7);
-          vis.graph.setZoom(1.5);
-        } else {
-          vis.array.setZoom(1);
-          vis.graph.setZoom(1);
-        }
+          if (SIZE === LARGE_SIZE) {
+            vis.array.setSize(3);
+            vis.array.setZoom(0.7);
+            vis.graph.setZoom(1.5);
+          } else {
+            vis.array.setZoom(1);
+            vis.graph.setZoom(1);
+          }
 
           // Initialize the array
           vis.array.set(array,

src/algorithms/controllers/HashingSearch.js

@@ -12,7 +12,8 @@ import {
   HASH_TYPE,
   PRIMES,
   POINTER_CUT_OFF,
-  newCycle
+  newCycle,
+  findTableSize
 } from './HashingCommon';
 
 // Bookmarks to link chunker with pseudocode
@@ -55,8 +56,8 @@ export default {
     // Assigning parameter values to local variables
     const ALGORITHM_NAME = params.name;
     const TARGET = params.target; // Target value we are searching for
-    const SIZE = params.hashSize; // Hash Modulo being used in the table
     let table = params.visualisers.array.instance.extractArray(1, EMPTY_CHAR); // The table with inserted values
+    const SIZE = findTableSize(table); // Hash Modulo being used in the table
 
     // Variable for testing
     let found = true;