<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>Thanks to some help from people here, I was able to get my code for Tasmanian camels puzzle working. However, it is horribly slow (I think. I’m not sure because this is my first program in python). The example run in the bottom of the code t
<p>Project Euler and other coding contests often have a maximum time to run or people boast of how fast their particular solution runs. With python, sometimes the approaches are somewhat kludgey - i.e., adding timing code to
<span class="inlinecode"
<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