#
Hash Search
Linear Probing Visualizer
Table Size
-
Hash Idx
-
Probes
-
Instructions
Enter data and optionally set
Hash Table Size
. If empty, size is auto-calculated as the next prime ≥ 2 × array length.
Click
Load Array
. The hash table is built using
linear probing
to resolve collisions.
Enter the
key
to search.
Use
Step Forward
to trace the algorithm logic step-by-step.
Note: Position displayed is
index + 1
(Human counting).
Visual Key:
"-" = Empty slot
Amber = Collision / Probed
Pink = Current Probe
Green = Found
Console
Array Input
Hash Table Size (Optional)
⬇ Load Array
Key Value
⏭ Step
▶ Auto
↻ Reset
No array loaded
System ready. Please load an array.
Algorithm Steps