Theory of algorithms and counting the number of operations

49 Views Asked by At

If 100 assignment operations m=n are performed in 1 second, then how many operations n^2 and 2^n will be performed in a second?

It seems to me that it is necessary to perform an operation that is the reverse of the necessary ones. That is, extract the root and get the logarithm

0

There are 0 best solutions below