title: How do I describe the Big O notation of a method with Math.pow or Math.log?
body: <p>Say I have methods that have a variable and a constant for pow/log:</p>
  
  <pre><code>double LogX(int x){
     return Math.Log(x, constantBase);
  }
  
  double PowX(int x){
     return Math.Pow(constant, x);
  }
  </code></pre>
  
  <p>I am not sure what the correct time complexity for these is when using the Math functions. My conceptual impression is that PowX would be O(n) since it has to multiply the constant n-1 times, but I know there's other ways to implement power functions and couldn't find a clear answer as to what I should assume there. If it is constant time, is it then O(n)? I'm similarly unsure of how to approach LogX correctly. </p>
  
  <p>I am using C# if that matters, but I'm looking for a general understanding of this. If I just had an equation f=constant^x or f=log(x), would I have a different answer for those time complexities than if I did it via the Math functions?</p>