ConceptSystems & CS
Theta notation
Theta notation represents a tight bound where both the best-case and worst-case running times take the same asymptotic order of steps.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
5Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Big O notation
- Omega notation
- Asymptotic complexity
- Basic Quicksort
- Complexity of merge sort
- Law of addition for Theta