Introduction
What this guide covers
Introduction Introduction # Software and Computer Engineering
Overview
Topics covered
- Introduction
- Fundamentals of Programming and Algorithms
- Algorithmic Thinking and Asymptotic Complexity
- 1.1 Mathematical Definition of Asymptotic Notations
- Properties of Asymptotic Algebra
- 1.2 Recurrence Resolution: The Master Theorem
Related concepts
Main connections
Compatible notation
Mathematical sample in LaTeX
The expression is rendered accessibly, with its LaTeX source preserved below.
View LaTeX source
\mathcal{O}(g(n)) = \{ f(n) : \exists \, c > 0, n_0 > 0 \text{As such that} 0 \le f(n) \le c \cdot g(n) \quad \forall n \ge n_0 \}