Every algorithm’s runtime gets summarized down to a single tidy label sooner or later — O(n), O(n²), O(log n) — and most people learn to recite those labels long before they understand what the notation is actually promising. This lab is built to fix that the hands-on way: six creatures live in the containment chamber below, one for each shape of growth, and the only way to clear this experiment is to prove — not guess — an upper bound, a lower bound, and ideally a tight bound for each one.