title: Big theta, Big O, Omega running times of functions
body: <p>I'm currently reading up on running times for algorithms. 
  I understand the different terms of Big O, Theta and Omega... Lower, upper etc bounding... </p>
  
  <p>However I have some assignments which requires me to list the Theta times. 
  An example could be <code>log(n)+n*sqrt(n)</code></p>
  
  <p>In general one could just set the upper bound, but that's not the Theta bounding. 
  How on earth do you find the theta bounding of a function? </p>
  
  <p>Until now I've just basically applied the big O bounding as the theta bound. However I'm concerned that this isn't correct at all.</p>