computation complexity练习题

""" 11 | computational complexity"""

"##"表示需要注意

"11.1 Big-Oh Notation"
"Polynomial bounds"
"""
1. T(n)=n+10        O(n)    (后面省略O)
2. T(n)=2n          n
3. T(n)=5n+15       n
4. T(n)=n^2         n^2
5. T(n)=2n^2 +n     n^2
6. T(n)=n^2−10n−1   n^2
7. T(n)=n/2         n
8. T(n)=10          1(##)
9. T(n)=n mod100    1(##)
"""

"(##)"
"Poly-logarithmic bounds"
"""
1. T(n)=10log(n)+10         log(n) 
2. T(n)=n+log(n)            n
3. T(n)=nlog(n)             nlog(n)
4. T(n)=log(10n+100)        log(n) 
5. T(n)=log10(n)            log(n)
6. T(n)=log1.5(n)           log(n)
7. T(n)=log(n^2)            log(n)
8. T(n)=log^2(n)            log^2(n)
9. T(n)=log^2(n)+nlog(n)    nlog(n)
"""

"Practice"
"""
1. T(n)=3,700,000                       1
2. T(n)=10n^2 +2                        n^2
3. T (n) = sin(360n/(2π))               1
4. T(n) = 10n^2 +2log^3(n)              n^2
5. T(n)=n^3/10−n^2