title: What is the tight bound for big O?
body: <p>When referring to big o, what is considered the <strong>tight bound</strong>? </p>
  
  <p>For example, in the function, f(n) = 10c<sub>7</sub>n^3 + 10c<sub>4</sub>nlog(n)) // This function represents the number of operations in terms of n //</p>
  
  <p>according to this example, the tight bound for big O would be O(n<sup>3</sup>).</p>
  
  <p>In this example, why is n<sup>3</sup> considered the tight bound for Big O?
  What characteristics does a tight bound exhibit?</p>
  
  <p>Also, what is a <strong>tilde value</strong>?</p>
  
  <p>according to this example, the tilde value for this function would be 10c<sub>7</sub>n<sup>3</sup>.</p>
  
  <p>I have searched online, but I can't seem to find anything useful. I was hoping someone could clear this up. </p>