travel_exploreVisualiser
Searching Visualiser
Choose a search algorithm and watch how it probes values, narrows ranges, skips blocks, builds frontiers and finds the target.
Linear Search
Checks each item from left to right until the target is found.
Searching algorithms included
Linear and Sentinel Linear: scan values from left to right, with sentinel search removing repeated bounds checks.
Binary, Meta Binary and Ternary: split sorted ranges using halves, bit jumps or thirds.
Jump, Interpolation, Exponential and Fibonacci: use blocks, value estimates, expanding bounds or Fibonacci offsets to reduce probes.
Best First Search: explores neighboring index nodes using a target-distance heuristic frontier.