Searching
LINEAR & BINARYHunt down a value. Watch the search space shrink and see exactly how each decision is made.
Step-by-step scanLive
pointersComplexity insights
Stop memorising dry steps. Explore searching and sorting algorithms through live animations, hands-on controls, and clear explanations.
for (let i = 0; i < n; i++) if (arr[j] > arr[j + 1]) swap(arr[j], arr[j + 1]) // repeat & improve // repeat & improveChoose a path. Take control.
Learn one step at a time.
Hunt down a value. Watch the search space shrink and see exactly how each decision is made.
Turn chaos into order. Follow comparisons, swaps, pivots, and every element finding its place.
Run a tiny Bubble Sort and watch the comparisons happen in real time.