Searches
Sorting was about putting things in order. Searching is about finding one thing quickly once they are. These step through the same way the sorts do: press play, scrub through the steps, and watch the source highlight line by line as each algorithm closes in on its target.
Line every search algorithm up and race them to find a target. Watch who closes the window fastest, how many comparisons each takes, and how Big-O behaves in real time.
Jump search leaps through a sorted array in blocks of about the square root of its length, then scans the one block that could hold the target. It sits between linear and binary search. Watch it run step by step.
Binary search is the payoff for keeping an array sorted. Halve the window each probe and even a million items fall in about twenty comparisons. Watch it run step by step.
Linear search just walks the list from the front and checks every value until it finds the one you want. It is the baseline every faster search is measured against. Watch it run step by step.
More searches coming weekly.