Watch algorithms run, one step at a time. No sign-up required.
Predict what happens next, then move forward one step
- Run a few steps and watch what happens
- Predict what happens next
- Step forward and check why
Linear Search
Compares values one by one from the left to find the target.
Binary Search
Compares the middle value and cuts the search range in half each time.
Insertion Sort
Takes one value out and inserts it into its correct place in the sorted part on the left.
Stack
A container where the last value pushed in is the first one popped out.
Queue
A container where the first value enqueued is the first one dequeued.
Recursion (Factorial)
A function calls itself, the calls pile up, then unwind and return values once the base case hits.
Breadth-First Search
Visits vertices nearest to the start first, using a queue.