~/ learn/ comp-372/ cards/ Asymptotic notation: Θ, O, Ω (and o, ω)
1 of 4

Type the formal definition of O(g(n)) (CLRS form)

Type the formal definition of O(g(n)) (CLRS form)

Answer

0 <= f(n) <= c * g(n) for all n >= n0

Read it as: there exist positive constants c and n0 so that f never exceeds c*g once n is large enough. The Ω definition flips the middle inequality: c*g(n) <= f(n).

space flip · ← → navigate · esc to exit
NORMAL ~/memra/library/091861f8-2250-4227-901b-7a75d3ec14c6/flashcard utf-8 LF