Progressive symbols for algorithmic analysis

Progressive symbols for algorithmic analysis

1. Θ (Big-theta) progressive tight-definite boundary

Θ(g(n)) = {f(n)}， Θ(g(n)) 是一组函数集合。<br/>具体定义：Θ(g(n)) = {f(n)：存在正常量C1，C2，n0；使得当n &gt; n0时，有C1g(n) &lt;= f(n) &lt;= C2g(n)}<br/>

2. O (big-o) progressive upper bound (possibly tight)

   O(g(n)) = {f(n)}，O(g(n)) 是一组函数集合。具体定义：O(g(n)) = {f(n)：存在正常量C，n0；使得当n > n0时，有0 <= f(n) <= Cg(n)}

3. Ω (big-omege) progressive lower bound (possibly tight)

Ω (g(n)) = {f(n)}，Ω (g(n)) 是一组函数集合。具体定义：Ω (g(n)) = {f(n)：存在正常量C，n0；使得当n > n0时，有0 <= Cg(n) <= f(n) }

4. O (Small-O) non-compact progressive upper bound

o(g(n)) = {f(n)}，o(g(n)) 是一组函数集合。具体定义：o(g(n)) = {f(n)：存在正常量C，n0；使得当n > n0时，有0 <= f(n) < Cg(n)}

5. Ω (small-omege) non-compact progressive lower bound

ω (g(n)) = {f(n)}，ω (g(n)) 是一组函数集合。具体定义：ω(g(n)) = {f(n)：存在正常量C，n0；使得当n > n0时，有0 <= Cg(n) < f(n) }

Progressive symbols for algorithmic analysis