mirror of
https://github.com/jackyzha0/quartz.git
synced 2025-12-24 05:14:06 -06:00
20 lines
690 B
Markdown
20 lines
690 B
Markdown
---
|
||
title: Big theta
|
||
draft: true
|
||
sr-due: 2022-04-27
|
||
sr-interval: 41
|
||
sr-ease: 290
|
||
---
|
||
tags: #review
|
||
|
||
---
|
||
|
||
### 0.1 Big-Θ
|
||
>Big theta means $f(n) = \Theta(g(n))$ if there are constants 0 < B < A such that for all sufficiently large n, ==$B × g(n) ≤ f(n) ≤ A × g(n)$==
|
||
|
||
- Upper and lower bound
|
||
- $Θ$ says that $g(n)$ provides **upper** and **lower** bound for $f(n)$
|
||
- "selection sort is $\Theta(n^2)$" -> the maximum number of operations will be bounded bothh above and below by some constant times $n^2$
|
||
- $f(n) = \Theta(g(n))$ means that f and g have similar growth rates
|
||
- if $f(n) = \Theta(g(n))$ then the opposite is also true
|
||
- usually $f(n)$ is complex but $g(n)$ is very simple |