Introduction to Algorithms growth in the third chapter function

Introduction to Algorithms growth in the third chapter function

Asymptotically tight infimum   

Asymptotic notation Θ, Ο, o, Ω, ω Detailed

Links: HTTPS: //blog.csdn.net/so_geili/article/details/53353593
## directory:

Asymptotically tight infimum notation: [Theta] ΘΘ (Big-Theta)
2. asymptotic bound on the symbol: O OO (Big-OH)
3. asymptotic lower bound notation: (Big-omege) ΩΩ [Omega]
4. Non-asymptotic indeed tight upper bound: o (small -OH)
5. the non-asymptotically tight lower bound determined: ω (small -omege)
6. the asymptotic notation Θ, Ο, o, Ω, ω relation
7. references