Cheat Sheet > EECS 281 Cheat Sheet
University of Michigan EECS 281 e cost of the function over multiple operations. Big-O : Asymptotic upper bound; worst case Big-Θ : Asymptotic tight bound; average case Big-Ω : Asymptotic lower bound; best case Master Theorem T (n )=aT(n b)+f (n) T (1)=1 Where a ≥ 1, b ≥ 1 if f(n) ∈ Θ(nc), then: Θ(nlogb a)if a > bc n n c ⋅log2¿ ¿¿ ...[Show More]
Preview 1 out of 4 pages
Reviews( 0 )
| Category: | |
| Number of pages: | 4 |
| Language: | English |
| Last updated: | 8 months ago |
| Downloads: | 1 |
| Views: | 1 |
-preview.png)
-preview.png)
