ConceptTheory & Algos
Big-O notation ()
A notation stating that a function has an upper bound, meaning it never grows faster than a specific rate.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.