- | Computational Complexities | |
---|---|---|
Acutal value | Parity | |
factorial n! | Θ(n) | O(1) |
Fibonacii Fn | Θ(n) | O(1) |
Lucas Ln | Θ(n) | O(1) |
Power nk | Θ(logk) | O(1) |
Permute P(n, k) | Θ(n-k) | O(1) |
Binomial Coefficient C(n, k) | Θ(min(n-k,k)) | O(log(n)loglog(n)) |
Σi> =1~ nik | Θ(n) | O(1) |