A* pathfinding explained in 3D — watch the algorithm explore cells using f = g + h to find the shortest path through obstacles. Interactive animation on Unseel.

Computer Science

ACID Properties

ACID properties — atomicity, consistency, isolation, durability — are the four guarantees a database transaction makes. Together they let you treat a multi-step operation as if it were a single, indiv

Databases

AVL Tree

An AVL tree is a self-balancing binary search tree that keeps the heights of any node\'s two subtrees within ±1, guaranteeing O(log n) lookup, insert, and delete by rebalancing with single or double ro

Data Structures

B+ Tree

A B+ tree is a balanced multi-way tree that stores all data in linked leaf nodes and uses internal nodes only as a search index. It\'s the data structure behind nearly every relational database index —

Data Structures

Bayes\' Theorem

Update beliefs when new evidence arrives. A positive medical test on a rare disease gives a surprisingly low probability of actual disease — Bayes corrects the intuition.

Probability

Central Limit Theorem

Averages of any distribution converge to a normal distribution as sample size grows. Why the bell curve appears everywhere — and statistics can work at all.

Statistics

Chain Rule

When functions are nested, the derivative is the product of outer and inner derivatives. The foundation of backpropagation in neural networks.

Calculus

Completing the Square

A geometric trick turning any quadratic into a perfect square plus a constant. Derives the quadratic formula and powers conic-section analysis. From Babylonian tablets to modern algebra.

Algebra