401 views

1 Answer

Best answer
7 votes
7 votes
There is no variable input needed to calculate $2^{100}$ and so complexity of calculation will be constant.
selected by
Answer:

Related questions

2 votes
2 votes
1 answer
2
Bikram asked Oct 4, 2016
329 views
The Matrix Chain-Product dynamic programming Algorithm runs in _______linear timeexponential timequadratic timecubic time
3 votes
3 votes
1 answer
4
Bikram asked Oct 4, 2016
502 views
Let we have 3 steps of an arbitrary program fragment whose running times are $O(n^2), \: O(n^3)$ and $O(n\log n)$, then the running time of whole program is$O(n^3)$$\Omeg...