Theoretical Computer Science Cheat Sheet f(n) = O(g(n)) f(n) = f~(g(n)) f(n) = O(g(n)) /(n) = o(g(n)) lim a . = a " - ' = Definitions iff q positive c, no such that 0 _< f(n) _< cgCn) vn >_ no. iff 3 positive c, no such that f(n) >_ co(m) >_ 0 Vn >_ no. iff i=i Series i - - nCn2 1 ) ' + In general: Ei'~ i=1 n--1 rn+l (n+ ~ - ~ i ~ : nCn+l)(2n6 + I ) ' i=1 ~--~ 13 _ n~-(" + 1) ~4 i=l n f(n) = O(g(n)) and -1- fCn) = n(g(n)). iff lin~_.~ f(n)Ig(n) = O. iff Ve 6 R, qn0 such that I~- - "I < e, Vn >_ n0. = m1 ((i + 11"~+' _ i,-+~ _ (-, + 1 ) i ' ) ] i~t i,.,, _ ( m : 1 B~n,~+1_k. ) m ~ l k=O "= Geometric series: /=O sup S infS liminfa, limsupa, least b 6 R such that b >_ s, c~ -- cn+l -- I c--l" c # 1, i=0 ci = 1 - c ' , cp1, I i=1 c'= " C 1-c' c<l, Vs6S. greatest
/lp/association-for-computing-machinery/theoretical-computer-science-cheat-sheet-Gp1zicNN4V