Glossary: Data Structures and Algorithms in Go
Big-O notation
Also written: Big-O, big O
A way to describe how the number of steps grows as the input size n grows. It drops constants and smaller terms, so only the shape of the growth matters.
Where the book teaches it
Related terms
Big-O shapes (O(1), O(log n), O(n), O(n log n), O(n²))O(V + E)Worst caseSteps