Analysis Algorithms Introduction

$$O\left(n^2\right)$$  

$$O\left(3n\right)$$  

$$O\left(\log_2n\right)$$  

$$O\left(273\right)$$  

$$O\left(n^3\right)$$  

$$O\left(n\log_{ }n\right)$$

$$O\left(n^2\right)$$

$$O\left(n\right)$$

$$O\left(10\cdot n\right)$$

$$f\left(n\right)=O\left(g\left(n\right)\right)$$

$$f\left(n\right)=\theta\left(g\left(n\right)\right)$$

$$f\left(n\right)=\Omega\left(g\left(n\right)\right)$$

30

15

5

3

2

$$O\left(n^2\right)$$

$$O\left(n^3\right)$$

$$O\left(30\cdot n\right)$$

$$O\left(n\right)$$

$$f\left(n\right)=\theta\left(g\left(n\right)\right)$$

$$f\left(n\right)=\Omega\left(g\left(n\right)\right)$$

$$f\left(n\right)=O\left(g\left(n\right)\right)$$

$$O\left(10\right)$$

$$O\left(n\right)$$

$$O\left(\frac{n}{2}\right)$$

$$O\left(\log_{ }n\right)$$

$$O(n^2)$$

$$O(\log n)$$

$$O(n)$$

$$O(n\log n)$$

$$f\left(n\right)=O\left(g\left(n\right)\right)$$

$$f\left(n\right)=\theta\left(g\left(n\right)\right)$$

$$f\left(n\right)=\Omega\left(g\left(n\right)\right)$$

$$O\left(n\cdot\log_{ }n\right)$$

$$O\left(n^2\right)$$

$$O\left(\log_{ }n\right)$$

$$O\left(2n\right)$$