title: Time complexity using Big-O notation
body: <p>I am having trouble understanding this time complexity <code>O(sqrt(B))</code> given that <code>B</code> is an integer.</p>
  
  <p>For example if I have a function...</p>
  
  <pre><code>int GetResult(int A, int B)
  {
  }
  </code></pre>
  
  <p>...and this function has a time complexity of <code>O(sqrt(B))</code>, what exactly is the time complexity?</p>
  
  <p>Sorry if this is a little vague...I'm not really sure how else to explain.</p>