328 views

1 Answer

Answer:

Related questions

3 votes
3 votes
1 answer
3
Bikram asked Oct 4, 2016
500 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...
2 votes
2 votes
1 answer
4
Bikram asked Oct 4, 2016
400 views
The time complexity of calculating $2^{100}$ isPolynomialExponentialConstantLinear