Search Algorithms: Linear vs Binary vs Jump vs Interpolation

This simulator lines up a sorted array as a 3D bar chart and runs four classic search algorithms over it one comparison at a time — Linear Search, Binary Search, Jump Search and Interpolation Search — so you can watch, step by step, how each one decides where to look next. Bars turn gold while being probed, grey once eliminated from the remaining search space, and green when the target is found; live counters track the number of comparisons made and how much of the array is still in play. Switching the array between a uniform and a heavily skewed distribution shows exactly where interpolation search's value-based guessing wins big or breaks down, while the size slider lets you confirm the O(log n), O(√n) and O(n) growth rates directly by comparing counts as the array grows.