AI engineering glossary · Data structures algorithms
What is Big-Theta notation?
Big-Theta notation: A notation saying a function grows at the same rate as another, bounded both above and below by constant multiples for large inputs. It is a tight bound, more precise than an upper bound alone.
Big-Theta notation: an example
Merge sort always takes about n log n steps, so its running time is Theta(n log n), not just O(n log n).
Related terms
More Data structures algorithms terms
- Binary search
- Binary search tree
- Binary tree
- Bipartite graph
- Bloom filter
- Breadth-first search
- Bubble sort
- Call stack
Where you learn it
Big-Theta notation is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.