ConceptSystems & CS
Big O Notation ()
An upper bound on the time complexity of merge sort, representing multiplied by growth.
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
3The lectures that define it or assume it, and the concepts next to it.