<p><strong>The Question</strong></p>
<p>How to find time complexity of an algorithm?</p>
<p><strong>What have I done before posting a question on SO ?</strong></p>
<p>I have gone through
<a href="https://www.google.co.in/search?aq=f&sugexp=chrome,
<p>I’d prefer as little formal definition as possible and simple mathematics.</p>
<p><br><br><br><h1>Answer</h1>
Quick note, this is almost certainly confusing
<a href="http://en.wikipedia.org/wiki/Big_O_notation" rel="noreferrer">Big O notati
<p>Most people with a degree in CS will certainly know what
<a href="http://www.nist.gov/dads/HTML/bigOnotation.html" rel="noreferrer">Big O stands for</a>
.
It helps us to measure how (in)efficient an algorithm really is and if you know in
<a href="