Isotoon explains computer science by running the algorithm in front of you. Ask about recursion, sorting, Big O or how the internet works and get a short animated video that shows each step, each comparison and each call.
An algorithm is easier to understand when you can watch it run. Ask about the one you are tracing by hand and see each step, each comparison and each call.
A recursive function solves a problem by calling itself on a smaller version of the same problem, until it reaches a base case it can answer directly. Each call waits on the call stack until the call it made returns, and the answers combine on the way back up. Without a base case the calls never stop, and the program runs out of stack space.
Bubble sort repeatedly swaps neighboring items, which takes on the order of n² comparisons for n items. Merge sort splits the list in half, sorts each half and merges the two sorted halves in a single pass. A list can only be halved about log₂ n times and each level of merging does about n work, so merge sort takes on the order of n log n: for a million items, about twenty million steps instead of about a trillion.
Big O describes how an algorithm's running time or memory grows as its input grows, ignoring constant factors and smaller terms. O(n) means doubling the input roughly doubles the work; O(n²) means it roughly quadruples it; O(log n) means doubling the input adds about one more step. It compares how algorithms scale, not how many milliseconds one run takes.
The ones marked 3D become a model you can turn, step through and tap.
Every claim is checked before anything is drawn, and every video lists its sources. See plans