title: Understanding asymptotic notations with less mathematical background
body: <p>Okay! I am a complete newbie to the field of algorithms. </p>
  
  <p>I could form a equation (e.g., <code>2n^2+3n+2</code>) from the algorithm and what I know is, only the highest power of the relation is considered for the order of growth of algorithms (such as <code>O(n^2)</code>), and I couldn't go beyond that. </p>
  
  <p>I referred a lot of books but due to my lesser knowledge in math, still helpless. I could see a lot of <code>f(n)</code>, <code>O(g(n))</code> kinda things and what I understood from them is that ignoring the constants (since they are negligible for larger input sets) </p>
  
  <p><code>f(n)</code> lies between 0 and the upper bound <code>constant*(g(n))</code> but I couldn't find what the books/standard university video tutorials mean by their relations <code>g(n)</code>. </p>
  
  <p>The asymptotic notations sound mathematically rigorous to me. Can someone help/link me to the correct place to learn these notations (0,theta, and omege) with lesser knowledge in math?</p>