Big Omega
A lower bound; the cost is at least a constant times the reference for large n.
Decision · step 2 of 10Complexity in Numbers: 3n + 5 is Theta(n)
n = 1: f = 8, between n = 1 and 4n = 4? The lower bound holds, 8 >= 1. The upper bound fails, 8 > 4: the constant 5 still dominates. Big O only promises the bound for large n.
What you will see
The measured curve stays above the reference.
Cost
| Space | O(1) |
|---|
How you work with it here
explore, compare two runs, run it on your own input.
Screen readers: Growth curves are described in words and as a table of operation counts for sample input sizes; each concept has a one-sentence spoken definition.
Reduced motion: Curves and counters update without animation.
Before this
Taught by the same lesson
Complexity in Numbers covers these too, in the same run.